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

Residuals and Least-Squares Property01:11

Residuals and Least-Squares Property

The vertical distance between the actual value of y and the estimated value of y. In other words, it measures the vertical distance between the actual data point and the predicted point on the line
If the observed data point lies above the line, the residual is positive, and the line underestimates the actual data value for y. If the observed data point lies below the line, the residual is negative, and the line overestimates the actual data value for y.
The process of fitting the best-fit...
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving01:29

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...
Calibration Curves: Linear Least Squares01:20

Calibration Curves: Linear Least Squares

A calibration curve is a plot of the instrument's response against a series of known concentrations of a substance. This curve is used to set the instrument response levels, using the substance and its concentrations as standards. Alternatively, or additionally, an equation is fitted to the calibration curve plot and subsequently used to calculate the unknown concentrations of other samples reliably.
For data that follow a straight line, the standard method for fitting is the linear...
One-Compartment Open Model: Wagner-Nelson and Loo Riegelman Method for ka Estimation01:24

One-Compartment Open Model: Wagner-Nelson and Loo Riegelman Method for ka Estimation

This lesson introduces two critical methods in pharmacokinetics, the Wagner-Nelson and Loo-Riegelman methods, used for estimating the absorption rate constant (ka) for drugs administered via non-intravenous routes. The Wagner-Nelson method relates ka to the plasma concentration derived from the slope of a semilog percent unabsorbed time plot. However, it is limited to drugs with one-compartment kinetics and can be impacted by factors like gastrointestinal motility or enzymatic degradation.
On...
Randomized Experiments01:13

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...
Systems of Linear Equations in Two Variables01:25

Systems of Linear Equations in Two Variables

Solving a system of linear equations is a fundamental concept in algebra. A system of equations consists of two or more linear equations involving the same set of variables. One of the most efficient algebraic methods for solving such systems is the substitution method. This technique involves expressing one variable in terms of the other from one equation and substituting it into the second equation. This method is particularly useful when one of the equations is easily rearranged.Consider the...

You might also read

Related Articles

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

Sort by
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
Same author

Algorithm 971: An Implementation of a Randomized Algorithm for Principal Component Analysis.

ACM transactions on mathematical software. Association for Computing Machinery·2017
Same journal

Tau protein as a regulator of mitochondrial function and dynamics.

Proceedings of the National Academy of Sciences of the United States of America·2026
Same journal

A scalable, dividing cell model for the robust propagation and quantification of human sporadic Creutzfeldt-Jakob disease prions.

Proceedings of the National Academy of Sciences of the United States of America·2026
Same journal

Epigenetic regulation of mesenchymal BMP signaling directs postnatal organ innervation.

Proceedings of the National Academy of Sciences of the United States of America·2026
Same journal

Single-shot wide-field biochemical imaging at 1 kHz frame rate.

Proceedings of the National Academy of Sciences of the United States of America·2026
Same journal

Morphogenesis and topological evolution of a frustrated nematic liquid crystal under confinement.

Proceedings of the National Academy of Sciences of the United States of America·2026
Same journal

B cell-intrinsic CXCR3 drives efficient generation of ectopic pulmonary germinal center responses to influenza A virus infection.

Proceedings of the National Academy of Sciences of the United States of America·2026
See all related articles

Related Experiment Videos

A fast randomized algorithm for overdetermined linear least-squares regression.

Vladimir Rokhlin1, Mark Tygert

  • 1Program in Applied Mathematics, Yale University, A. K. Watson Hall, 51 Prospect Street, New Haven, CT 06511, USA.

Proceedings of the National Academy of Sciences of the United States of America
|September 10, 2008
PubMed
Summary
This summary is machine-generated.

A new randomized algorithm efficiently solves overdetermined linear least-squares regression problems. This method offers a faster computational approach compared to traditional techniques for finding accurate solutions.

Related Experiment Videos

Area of Science:

  • Numerical Analysis
  • Computational Mathematics
  • Linear Algebra

Background:

  • Overdetermined linear least-squares regression is a fundamental problem in many scientific and engineering fields.
  • Classical methods like QR-decomposition and bidiagonalization have high computational costs for large datasets.
  • There is a need for more efficient algorithms to solve these problems.

Purpose of the Study:

  • To introduce a novel randomized algorithm for solving overdetermined linear least-squares regression.
  • To analyze the computational complexity of the proposed algorithm.
  • To demonstrate the algorithm's performance through numerical examples.

Main Methods:

  • The study introduces a randomized algorithm for overdetermined linear least-squares regression.
  • The algorithm computes a solution vector x that minimizes the Euclidean norm ||Ax - b || to a relative precision epsilon.
  • The computational cost is analyzed in terms of floating-point operations.

Main Results:

  • The proposed randomized algorithm requires typically ((log(n)+log(1/epsilon))mn+n(3)) floating-point operations.
  • This computational cost is significantly less than the (mn(2)) operations required by classical methods.
  • Numerical examples confirm the algorithm's effectiveness and performance.

Conclusions:

  • The developed randomized algorithm provides a computationally efficient alternative for solving overdetermined linear least-squares problems.
  • The algorithm achieves a specified relative precision epsilon.
  • This advancement has potential implications for large-scale data analysis and scientific computing.