Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Concept Videos

The Squeeze Theorem01:30

The Squeeze Theorem

314
Certain mathematical functions exhibit unpredictable or highly variable behavior near specific input values, making direct evaluation of their limits challenging. This complexity may arise from rapid oscillations or irregular patterns that obscure the function’s trend. In such cases, the Squeeze Theorem offers a reliable method for determining limits.According to the Squeeze Theorem, if a function is confined between two other functions near a particular point, and both outer functions...
314
BIBO stability of continuous and discrete -time systems01:24

BIBO stability of continuous and discrete -time systems

889
System stability is a fundamental concept in signal processing, often assessed using convolution. For a system to be considered bounded-input bounded-output (BIBO) stable, any bounded input signal must produce a bounded output signal. A bounded input signal is one where the modulus does not exceed a certain constant at any point in time.
To determine the BIBO stability, the convolution integral is utilized when a bounded continuous-time input is applied to a Linear Time-Invariant (LTI) system....
889
Reduced Mass Coordinates: Isolated Two-body Problem01:12

Reduced Mass Coordinates: Isolated Two-body Problem

2.3K
In classical mechanics, the two-body problem is one of the fundamental problems describing the motion of two interacting bodies under gravity or any other central force. When considering the motion of two bodies, one of the most important concepts is the reduced mass coordinates, a quantity that allows the two-body problem to be solved like a single-body problem. In these circumstances, it is assumed that a single body with reduced mass revolves around another body fixed in a position with an...
2.3K
Probability Laws01:49

Probability Laws

43.9K
Overview
43.9K
Routh-Hurwitz Criterion II01:19

Routh-Hurwitz Criterion II

959
In the application of the Routh-Hurwitz criterion, two specific scenarios can arise that complicate stability analysis.
The first scenario occurs when a singular zero appears in the first column of the Routh table. This situation creates a division by zero issues. To resolve this, a small positive or negative number, denoted as epsilon (∈), is substituted for the zero. The stability analysis proceeds by assuming a sign for ∈. If ∈ is positive, any sign change in the first...
959
Midpoint Rule01:20

Midpoint Rule

22
Approximating areas under curved boundaries is a common problem in applied mathematics, particularly when an exact calculation is difficult or impractical. One effective numerical method for this purpose is the Midpoint Rule, which provides an estimate of the area under a curve by using rectangular approximations over a specified interval.Description of the Midpoint RuleThe Midpoint Rule begins by dividing the given interval into a number of equal subintervals. For each subinterval, the...
22

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

The Born Rule-100 Years Ago and Today.

Entropy (Basel, Switzerland)·2025
Same author

A new limited memory method for unconstrained nonlinear least squares.

Soft computing·2022
Same author

A manifold-based approach to sparse global constraint satisfaction problems.

Journal of global optimization : an international journal dealing with theoretical and computational aspects of seeking global optima and their applications in science, management and engineering·2019
Same author

A computational study of global optimization solvers on two trust region subproblems.

Journal of global optimization : an international journal dealing with theoretical and computational aspects of seeking global optima and their applications in science, management and engineering·2019
Same author

Using interval unions to solve linear systems of equations with uncertainties.

BIT. Numerical mathematics·2019
Same author

Rigorous packing of unit squares into a circle.

Journal of global optimization : an international journal dealing with theoretical and computational aspects of seeking global optima and their applications in science, management and engineering·2019
Same journal

LRCS: Duality, LP bounds, and field size.

Designs, codes, and cryptography·2026
Same journal

Information-set decoding for convolutional codes.

Designs, codes, and cryptography·2025
Same journal

Knot theory and error-correcting codes.

Designs, codes, and cryptography·2025
Same journal

New results on non-disjoint and classical strong external difference families.

Designs, codes, and cryptography·2025
Same journal

Guessing less and better: improved attacks on GIFT-64.

Designs, codes, and cryptography·2025
Same journal

Conjunctive hierarchical secret sharing by finite geometry.

Designs, codes, and cryptography·2025
See all related articles

Related Experiment Video

Updated: Jan 18, 2026

Development of an Individual-Tree Basal Area Increment Model using a Linear Mixed-Effects Approach
04:35

Development of an Individual-Tree Basal Area Increment Model using a Linear Mixed-Effects Approach

Published on: July 3, 2020

3.7K

Bounding basis reduction properties.

Arnold Neumaier1

  • 1Fakultät für Mathematik, Universität Wien, Oskar-Morgenstern-Platz 1, 1090 Vienna, Austria.

Designs, Codes, and Cryptography
|October 1, 2019
PubMed
Summary
This summary is machine-generated.

This study introduces new analysis methods for basis reduction, enhancing complexity bounds and guarantees for reduction algorithms. These techniques leverage linear equations to improve understanding of bit size changes during reduction steps.

Keywords:
BKZ algorithmBasis reductionLLL algorithmLattices

More Related Videos

A Tactile Automated Passive-Finger Stimulator TAPS
19:44

A Tactile Automated Passive-Finger Stimulator TAPS

Published on: June 3, 2009

14.2K
A Psychophysics Paradigm for the Collection and Analysis of Similarity Judgments
08:12

A Psychophysics Paradigm for the Collection and Analysis of Similarity Judgments

Published on: March 1, 2022

2.9K

Related Experiment Videos

Last Updated: Jan 18, 2026

Development of an Individual-Tree Basal Area Increment Model using a Linear Mixed-Effects Approach
04:35

Development of an Individual-Tree Basal Area Increment Model using a Linear Mixed-Effects Approach

Published on: July 3, 2020

3.7K
A Tactile Automated Passive-Finger Stimulator TAPS
19:44

A Tactile Automated Passive-Finger Stimulator TAPS

Published on: June 3, 2009

14.2K
A Psychophysics Paradigm for the Collection and Analysis of Similarity Judgments
08:12

A Psychophysics Paradigm for the Collection and Analysis of Similarity Judgments

Published on: March 1, 2022

2.9K

Area of Science:

  • Computational Mathematics
  • Algorithm Analysis

Background:

  • Basis reduction algorithms are crucial in computational mathematics.
  • Existing methods lack strong complexity guarantees.
  • Understanding bit size changes is key to algorithm efficiency.

Purpose of the Study:

  • To develop improved analysis techniques for basis reduction.
  • To establish strong complexity bounds for reduction algorithms.
  • To provide reduced basis guarantees for algorithm variants.

Main Methods:

  • Exploiting linear equations and inequalities.
  • Analyzing bit sizes before and after reduction steps.
  • Developing novel analytical frameworks for basis reduction.

Main Results:

  • Demonstrated improved complexity bounds for traditional reduction algorithms.
  • Provided guarantees for reduced basis properties.
  • Established a rigorous analytical approach for basis reduction.

Conclusions:

  • The new analysis techniques offer significant improvements in understanding and bounding basis reduction algorithms.
  • These advancements are applicable to both traditional and variant reduction methods.
  • The findings pave the way for more efficient and reliable computational algorithms.