Pages that link to "Item:Q3942314"

The following pages link to Some Extensions of an Algorithm for Sparse Linear Least Squares Problems (Q3942314):

Displayed 11 items.

• Rank and null space calculations using matrix decomposition without column interchanges (Q1074304) ‎ (← links)
• Approximation by cubic \(C^ 1\)-splines on arbitrary triangulations (Q1077650) ‎ (← links)
• An extension of Karmarkar's algorithm for linear programming using dual variables (Q1090601) ‎ (← links)
• Karmarkar's projective algorithm: A null space variant for multi- commodity generalized networks (Q1098761) ‎ (← links)
• Sparse linear problems and the least squares method (Q1110269) ‎ (← links)
• A direct method for sparse least squares problems with lower and upper bounds (Q1112557) ‎ (← links)
• Conical projection algorithms for linear programming (Q1117835) ‎ (← links)
• Fast orthogonal decomposition of rank deficient Toeplitz matrices (Q1208061) ‎ (← links)
• On stable least squares solution to the system of linear inequalities (Q2454696) ‎ (← links)
• (Q2760330) ‎ (← links)
• Computing a Sparse Basis for the Null Space (Q3774827) ‎ (← links)