Pages that link to "Item:Q1152201"

The following pages link to Solution of sparse linear least squares problems using Givens rotations (Q1152201):

Displaying 42 items.

• Row-ordering schemes for sparse Givens transformations. I. Bipartite graph model (Q761765) (← links)
• An algorithm to compute a sparse basis of the null space (Q799342) (← links)
• The solution of large-scale least-squares problems on supercomputers (Q918420) (← links)
• Sparse QR factorization on a massively parallel computer (Q973426) (← links)
• The projection method for solving nonlinear systems of equations under the ''most violated constraint'' control (Q1069671) (← links)
• A pipelined Givens method for computing the QR factorization of a sparse matrix (Q1072333) (← links)
• Rank and null space calculations using matrix decomposition without column interchanges (Q1074304) (← links)
• Quasi-Newton methods with factorization scaling for solving sparse nonlinear systems of equations (Q1075739) (← links)
• Approximation by cubic \(C^ 1\)-splines on arbitrary triangulations (Q1077650) (← links)
• Row-ordering schemes for sparse Givens transformations. II. Implicit graph model (Q1078976) (← links)
• Row-ordering schemes for sparse Givens transformations. III. Analyses for a model problem (Q1078977) (← links)
• Householder reflections versus Givens rotations in sparse orthogonal decomposition (Q1089725) (← links)
• An extension of Karmarkar's algorithm for linear programming using dual variables (Q1090601) (← links)
• Linear algebra on high performance computers (Q1093318) (← links)
• Karmarkar's projective algorithm: A null space variant for multi- commodity generalized networks (Q1098761) (← links)
• A survey of the advances in the exploitation of the sparsity in the solution of large problems (Q1099926) (← links)
• Solving large and sparse linear least-squares problems by conjugate gradient algorithms (Q1102707) (← links)
• An accelerated successive orthogonal projections method for solving large-scale linear feasibility problems (Q1107277) (← links)
• Sparse linear problems and the least squares method (Q1110269) (← links)
• A note on the implementation of the accelerated successive orthogonal projections method for solving large scale linear feasibility problems (Q1110276) (← links)
• A direct method for sparse least squares problems with lower and upper bounds (Q1112557) (← links)
• Preconditioning techniques for nonsymmetric and indefinite linear systems (Q1114329) (← links)
• Large-scale geodetic least-squares adjustment by dissection and orthogonal decomposition (Q1156451) (← links)
• A direct method for the solution of sparse linear least squares problems (Q1157668) (← links)
• Comparison of two pivotal strategies in sparse plane rotations (Q1164377) (← links)
• Solving combinatorial optimization problems using Karmarkar's algorithm (Q1196181) (← links)
• A parallel projection method for overdetermined nonlinear systems of equations (Q1208707) (← links)
• Use of the Gibbs sampler to invert large, possibly sparse, positive definite matrices (Q1300831) (← links)
• Predicting the structure of sparse orthogonal factors (Q1318224) (← links)
• Optimal matrix approximants in structural identification (Q1321201) (← links)
• Separators and structure prediction in sparse orthogonal factorization (Q1361831) (← links)
• Matrix enlarging methods and their application (Q1371659) (← links)
• Solving sparse linear least-squares problems on some supercomputers by using large dense blocks (Q1371662) (← links)
• Accuracy of preconditioned CG-type methods for least squares problems. (Q1416375) (← links)
• A Schur complement approach to preconditioning sparse linear least-squares problems with some dense rows (Q1625762) (← links)
• Stability analysis of the method of seminormal equations for linear least squares problems (Q1821506) (← links)
• An algorithm for solving sparse nonlinear least squares problems (Q1822462) (← links)
• A hybrid algorithm for the solution of a single commodity spatial equilibrium model (Q1919772) (← links)
• A null-space approach for large-scale symmetric saddle point systems with a small and non zero \((2, 2)\) block (Q2159428) (← links)
• A class of incomplete orthogonal factorization methods. II: Implemetation and results (Q2568630) (← links)
• A numerically stable reduced-gradient type algorithm for solving large- scale linearly constrained minimization problems (Q2638951) (← links)
• A note on the computation of an orthonormal basis for the null space of a matrix (Q3326727) (← links)