scientific article

Publication date: 1991

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

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

Mathematics Subject Classification ID

Numerical solutions to overdetermined systems, pseudoinverses (65F20) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35)

Related Items

Low rank updates in preconditioning the saddle point systems arising from data assimilation problems, 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, Collocation-quadrature methods and fast summation for Cauchy singular integral equations with fixed singularities, Perturbation-based inference for diffusion processes: Obtaining effective models from multiscale data, Least-squares fitting Gompertz curve, Multiplicative perturbation theory of the Moore-Penrose inverse and the least squares problem, Pseudo-Schur complements and their properties, A Schur complement approach to preconditioning sparse linear least-squares problems with some dense rows, New vector sequence transformations, A projection method for semidefinite linear systems and its applications, Experiments on orthogonalization by biorthogonal representations of orthogonal projectors, Applications of CS decomposition in linear combinations of two orthogonal projectors, On nonlinear weighted errors-in-variables parameter estimation problem in the three-parameter Weibull model, Efficient over-determined implementation of the immersed boundary conditions method, Least squares problems with inequality constraints as quadratic constraints, A survey of the advances in the exploitation of the sparsity in the solution of large problems, Out-of-core SVD performance for document indexing, Using QR factorization and SVD to solve input estimation problems in structural dynamics, 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, Solving large and sparse linear least-squares problems by conjugate gradient algorithms, A non-intrusive acceleration technique for compressible flow solvers based on dynamic mode decomposition, A mathematical model of controlling the growth of tissue in pigs, 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, The inverse problem of electrocardiography: A solution in terms of single- and double-layer sources on the epicardial surface, Total least squares fitting Michaelis--Menten enzyme kinetic model function, General regularized boundary condition for multi-speed lattice Boltzmann models, An augmented LSQR method, On the perturbation bounds of g-inverses and oblique projections, Kronecker product and SVD approximations in image restoration, Matrices \(A\) such that \(AA^\dagger-A^\dagger A\) are nonsingular, Conjugate gradient type methods for unsymmetric and inconsistent systems of linear equations, Implementations of range restricted iterative methods for linear discrete ill-posed problems, Solving large-scale constrained least-squares problems., Iterative computation of the smallest singular value and the corresponding singular vectors of a matrix., A note on simple nonzero finite generalized singular values, Matrix LSQR algorithm for structured solutions to quaternionic least squares problem, A necessary and sufficient criteria for the existence of the least squares estimate for a 3-parametric exponential function., Multiscale modeling using goal-oriented adaptivity and numerical homogenization. I: Mathematical formulation and numerical results, Multiscale modeling using goal-oriented adaptivity and numerical homogenization. II: Algorithms for the Moore-Penrose pseudoinverse, A direct method for the solution of sparse linear least squares problems, Accuracy of preconditioned CG-type methods for least squares problems., Fast numerical solution of Fredholm integral equations with stationary kernels, An adaptive fast direct solver for boundary integral equations in two dimensions, Fast B-spline curve fitting by L-BFGS, Computational methods for modifying seemingly unrelated regressions models., On the application of iterative methods of nondifferentiable optimization to some problems of approximation theory, A note on iterative refinement for seminormal equations, Over-determined formulation of the immersed boundary conditions method, Iterative algorithms for computing the singular subspace of a matrix associated with its smallest singular values, Fast ESPRIT algorithms based on partial singular value decompositions, Optimal symplectic Householder transformations for \(SR\) decomposition, A new \(L\)-curve for ill-posed problems, Recovering the electrical conductivity of the soil via a linear integral model, Randomized block Kaczmarz method with projection for solving least squares, Generalization of the Sherman-Morrison-Woodbury formula involving the Schur complement, Sparsity preserving optimal control of discretized PDE systems, Existence of optimal solution for exponential model by least squares, A block QMR algorithm for non-Hermitian linear systems with multiple right-hand sides, Error minimizing relaxation strategies in Landweber and Kaczmarz type iterations, Vector extrapolation based Landweber method for discrete ill-posed problems, A comparative study of algorithms for solving seemingly unrelated regressions models, Partial least-squares vs. Lanczos bidiagonalization. I: Analysis of a projection method for multiple regression, Analysis of directed networks via partial singular value decomposition and Gauss quadrature, Computation of Huber's \(M\)-estimates for a block-angular regression problem, A comparison of algorithms for fitting the PARAFAC model, Direct minimization of the least-squares spectral element functional. I: Direct solver, Fast thresholding algorithms with feedbacks for sparse signal recovery, Symplectic Householder transformations for a QR-like decomposition, a geometric and algebraic approaches, Fast and efficient linear programming and linear least-squares computations, Perturbation, extraction and refinement of invariant pairs for matrix polynomials, Stable solutions of linear systems involving long chain of matrix multiplications, Some results on condition numbers of the scaled total least squares problem, Randomized preprocessing of homogeneous linear systems of equations, Cascadic multilevel methods for fast nonsymmetric blur- and noise-removal, The TaSe-NF model for function approximation problems: approaching local and global modelling, The sagitta method for solving linear programs, Iterative methods for ill-posed problems and semiconvergent sequences, Vector spherical harmonics application to 3-D tomography problem, Accelerating scientific computations with mixed precision algorithms, Shift-splitting preconditioners for a class of block three-by-three saddle point problems, On nonlinear weighted total least squares parameter estimation problem for the three-parameter Weibull density, Decomposition methods for large linear discrete ill-posed problems, An iterative method for linear discrete ill-posed problems with box constraints, Spectral likelihood expansions for Bayesian inference, Static hedging under maturity mismatch, Hybrid norms and bounds for overdetermined linear systems, CoSaMP: Iterative signal recovery from incomplete and inaccurate samples, Block RLS using row Householder reflections, Fast robust regression algorithms for problems with Toeplitz structure, On iterative algorithms for linear least squares problems with bound constraints, A Jacobi-Davidson type method for the generalized singular value problem, Global reparametrization for curve approximation, 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, Tikhonov regularization and the L-curve for large discrete ill-posed problems, Some new properties of the equality constrained and weighted least squares problem, Computing Fréchet derivatives in partial least squares regression, General scheme for solving linear algebraic problems by direct methods, Applying numerical linear algebra techniques to analyzing algorithms in signal processing