Search research articles

ABOUT JoVE

Overview Leadership Blog JoVE Help Center

AUTHORS

Publishing Process Editorial Board Scope & Policies Peer Review FAQ Submit

LIBRARIANS

Testimonials Subscriptions Access Resources Library Advisory Board FAQ

RESEARCH

JoVE Journal Methods Collections JoVE Encyclopedia of Experiments Archive

EDUCATION

JoVE Core JoVE Business JoVE Science Education JoVE Lab Manual Faculty Resource Center Faculty Site

Terms & Conditions of Use

Related Concept Videos

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

Mechanistic models play a crucial role in algorithms for numerical problem-solving, particularly in nonlinear mixed effects modeling (NMEM). These models aim to minimize specific objective functions by evaluating various parameter estimates, leading to the development of systematic algorithms. In some cases, linearization techniques approximate the model using linear equations.
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...

Randomized Experiments

Randomized Experiments

The randomization process involves assigning study participants randomly to experimental or control groups based on their probability of being equally assigned. Randomization is meant to eliminate selection bias and balance known and unknown confounding factors so that the control group is similar to the treatment group as much as possible. A computer program and a random number generator can be used to assign participants to groups in a way that minimizes bias.
Simple randomization
Simple...

Gaussian Elimination: Problem Solving

Gaussian Elimination: Problem Solving

Systems of linear equations in several variables are pivotal in modeling complex scenarios involving multiple unknowns and constraints. Such systems are widely used in various fields to represent relationships where several conditions must be simultaneously satisfied. Each variable in the system corresponds to an unknown quantity, while each equation imposes a linear constraint, leading to a structured approach for analyzing and solving real-world problems.A system of three equations with three...

Routh-Hurwitz Criterion II

Routh-Hurwitz Criterion II

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 column of the Routh...

Application of Linearization and Approximation

Application of Linearization and Approximation

A drone flying through complex terrain often relies on more than one sensing method to estimate small changes in altitude. Along with direct measurements, air pressure provides a useful indirect indicator of vertical movement. Atmospheric pressure decreases as altitude increases, and this relationship is commonly described using an exponential model. Although accurate, converting pressure measurements into altitude values requires calculations that are too complex to perform repeatedly during...

Linear Approximations

Linear Approximations

For a differentiable function of two variables, linear approximation estimates values near a known point by replacing the curved surface with its tangent plane. Consider the function\begin{equation*}f(x,y)=x^2+3y^2\end{equation*}near the point (2, 1). The exact value at this point is f(2, 1) = 22 + 3(1)2 = 4 + 3 = 7.The linear approximation of f(x, y)) near (a, b) is\begin{equation*}L(x,y)=f(a,b)+f_x(a,b)(x-a)+f_y(a,b)(y-b)\end{equation*}First, compute the partial derivatives: fx(x, y) = 2x and...

You might also read

Related Articles

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

Sort by

Same author

Streaming Quantiles Algorithms with Small Space and Update Time.

Sensors (Basel, Switzerland)·2022

Same author

On the efficient evaluation of the azimuthal Fourier components of the Green's function for Helmholtz's equation in cylindrical coordinates.

Journal of computational physics·2022

Same author

Randomized algorithms for distributed computation of principal component analysis and singular value decomposition.

Advances in computational mathematics·2021

Same author

A Fast Summation Method for Oscillatory Lattice Sums.

Journal of mathematical physics·2020

Same author

A FAST SIMPLE ALGORITHM FOR COMPUTING THE POTENTIAL OF CHARGES ON A LINE.

Applied and computational harmonic analysis·2020

Same author

A hierarchical loss and its problems when classifying non-hierarchically.

PloS one·2019

Search research articles

Related Experiment Video

Updated: Jul 9, 2026

Design and Application of a Fault Detection Method Based on Adaptive Filters and Rotational Speed Estimation for an Electro-Hydrostatic Actuator

Design and Application of a Fault Detection Method Based on Adaptive Filters and Rotational Speed Estimation for an Electro-Hydrostatic Actuator

Published on: October 28, 2022

Randomized algorithms for the low-rank approximation of matrices.

Edo Liberty¹, Franco Woolfe, Per-Gunnar Martinsson

¹Department of Computer Science and Program in Applied Math, Yale University, 51 Prospect Street, New Haven, CT 06511, USA.

Proceedings of the National Academy of Sciences of the United States of America

|December 7, 2007

Summary

New randomized algorithms offer efficient and reliable low-rank matrix approximations and singular value decomposition for large datasets. These probabilistic methods present a negligible failure rate, outperforming traditional techniques.

Related Experiment Videos

Last Updated: Jul 9, 2026

Design and Application of a Fault Detection Method Based on Adaptive Filters and Rotational Speed Estimation for an Electro-Hydrostatic Actuator

Design and Application of a Fault Detection Method Based on Adaptive Filters and Rotational Speed Estimation for an Electro-Hydrostatic Actuator

Published on: October 28, 2022

Area of Science:

Numerical Analysis
Linear Algebra
Computational Mathematics

Background:

Low-rank approximation is crucial for dimensionality reduction and data compression.
Singular value decomposition (SVD) is a fundamental tool in linear algebra with broad applications.
Classical deterministic algorithms for these tasks can be computationally expensive for large matrices.

Purpose of the Study:

To introduce and evaluate two novel randomized algorithms for constructing low-rank matrix approximations.
To demonstrate the application of these algorithms to singular value decomposition (SVD) of numerically low-rank matrices.
To compare the efficiency and reliability of the proposed randomized methods against classical deterministic approaches.

Main Methods:

Implementation of two recently proposed randomized algorithms.
Application of these algorithms to compute low-rank approximations.
Evaluation of their performance in singular value decomposition (SVD).
Numerical experiments to illustrate the algorithms' behavior.

Main Results:

The randomized algorithms efficiently construct low-rank matrix approximations.
They are effective in evaluating singular value decompositions (SVD) for low-rank matrices.
The probabilistic methods exhibit a negligible failure rate (e.g., 10^-17).
The new procedures are often more efficient and reliable than deterministic methods.
The algorithms demonstrate natural parallelization capabilities.

Conclusions:

Randomized algorithms provide a powerful and efficient alternative for low-rank matrix approximation and SVD.
These methods offer significant advantages in terms of speed and reliability for large-scale numerical problems.
The probabilistic nature of the algorithms ensures high accuracy with minimal failure probability.