Publication:3361799

Publication date: 1991

algorithms; iterative methods; underdetermined linear systems; linear least squares problems; Gram-Schmidt factorization; backward stable methods; parallel block preconditioners

Mathematics Subject Classification ID

65F20: Numerical solutions to overdetermined systems, pseudoinverses

65F10: Iterative numerical methods for linear systems

65F35: Numerical computation of matrix norms, conditioning, scaling

Related Items

A numerical method for backward parabolic problems with non-selfadjoint elliptic operators, A Newton method for rigid body frictional impact with multiple simultaneous impact points, Existence of optimal solution for exponential model by least squares, A block QMR algorithm for non-Hermitian linear systems with multiple right-hand sides, The sagitta method for solving linear programs, On iterative algorithms for linear least squares problems with bound constraints, General scheme for solving linear algebraic problems by direct methods, A mathematical model of controlling the growth of tissue in pigs, Total least squares fitting Michaelis--Menten enzyme kinetic model function, A survey of the advances in the exploitation of the sparsity in the solution of large problems, Solving large and sparse linear least-squares problems by conjugate gradient algorithms, Kronecker product and SVD approximations in image restoration, Conjugate gradient type methods for unsymmetric and inconsistent systems of linear equations, A direct method for the solution of sparse linear least squares problems, Fast numerical solution of Fredholm integral equations with stationary kernels, Iterative algorithms for computing the singular subspace of a matrix associated with its smallest singular values, Block RLS using row Householder reflections, Global reparametrization for curve approximation, The inverse problem of electrocardiography: A solution in terms of single- and double-layer sources on the epicardial surface, Solving large-scale constrained least-squares problems., Iterative computation of the smallest singular value and the corresponding singular vectors of a matrix., A necessary and sufficient criteria for the existence of the least squares estimate for a 3-parametric exponential function., Accuracy of preconditioned CG-type methods for least squares problems., Computational methods for modifying seemingly unrelated regressions models., Tikhonov regularization and the L-curve for large discrete ill-posed problems, Some new properties of the equality constrained and weighted least squares problem, Hybrid norms and bounds for overdetermined linear systems, Maintaining LU factors of a general sparse matrix, Efficient algorithms for block downdating of least squares solutions, Accurate conjugate gradient methods for families of shifted systems, Computing smallest singular triplets with implicitly restarted Lanczos bidiagonalization, Fitting conics of specific types to data, Applying numerical linear algebra techniques to analyzing algorithms in signal processing, Least-squares fitting Gompertz curve, Pseudo-Schur complements and their properties, New vector sequence transformations, A projection method for semidefinite linear systems and its applications, Perturbation theory for orthogonal projection methods with applications to least squares and total least squares, Self-scaling fast rotations for stiff and equality-constrained linear least squares problems, Experiments on orthogonalization by biorthogonal representations of orthogonal projectors, Out-of-core SVD performance for document indexing, Using QR factorization and SVD to solve input estimation problems in structural dynamics, Symplectic Householder transformations for a QR-like decomposition, a geometric and algebraic approaches, Iterative methods for ill-posed problems and semiconvergent sequences, Decomposition methods for large linear discrete ill-posed problems, An iterative method for linear discrete ill-posed problems with box constraints, Relations between SVD and GSVD of discrete regularization problems in standard and general form, A numerically stable reduced-gradient type algorithm for solving large- scale linearly constrained minimization problems, Fast and efficient linear programming and linear least-squares computations