scientific article; zbMATH DE number 3438258
From MaRDI portal
zbMath0278.65037MaRDI QIDQ4404310
Publication date: 1974
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Roundoff error (65G50)
Related Items
A real algorithm for the Hermitian eigenvalue decomposition, A survey of the advances in the exploitation of the sparsity in the solution of large problems, A modification to the LINPACK downdating algorithm, Solving large and sparse linear least-squares problems by conjugate gradient algorithms, The Singular Value Decomposition: Anatomy of Optimizing an Algorithm for Extreme Scale, Self-scaling fast rotations for stiff and equality-constrained linear least squares problems, Computer Solution and Perturbation Analysis of Generalized Linear Least Squares Problems, A dual projective simplex method for linear programming, Computational methods of linear algebra, Fast givens rotations for orthogonal similarity transformations, Comparison of two pivotal strategies in sparse plane rotations, Computationally efficient generation of Gaussian conditional simulations over regular sample grids, A self-scaling G-transformation for weighted least squares problems, On a modification of the QZ algorithm with fast Givens rotations, A comparison of algorithms for forming the QR decomposition for use in regression, Procedures for optimization problems with a mixture of bounds and general linear constraints, Stability analysis of the G-algorithm and a note on its applications to sparse least squares problems
