Pages that link to "Item:Q4778229"
From MaRDI portal
The following pages link to Least Squares Computations by Givens Transformations Without Square Roots (Q4778229):
Displaying 18 items.
- Parallel algorithms for solving linear equations using givens transformations (Q3779651) (← links)
- Updating conjugate directions by the BFGS formula (Q3783852) (← links)
- An algorithm for linear least squares problems with equality and nonnegativity constraints (Q3911670) (← links)
- Modifications and implementation of the ellipsoid algorithm for linear programming (Q3934131) (← links)
- Systolic array implementation of the square-root Chandrasekhar filter (Q3982003) (← links)
- Factorized Variable Metric Methods for Unconstrained Optimization (Q4133432) (← links)
- Least squares computations based on the cholesky decomposition of the correlation matrix (Q4140204) (← links)
- Performing armchair roundoff analyses of statistical algorithms (Q4170053) (← links)
- Extended model set, global data and threshold model identification of severely non-linear systems (Q4205380) (← links)
- Orthogonal least squares methods and their application to non-linear system identification (Q4205381) (← links)
- INITIALIZATION OF THE KALMAN FILTER WITH PARTIALLY DIFFUSE INITIAL CONDITIONS (Q4715710) (← links)
- Methods for Modifying Matrix Factorizations (Q4778230) (← links)
- A SYSTOLIC ARCHITECTURE FOR CAPON'S DIRECTIONS-OF-ARRIVAL (DOA) ESTIMATION METHOD (Q4819958) (← links)
- Computationally efficient cholesky factorization of a covariance matrix with block toeplitz structure (Q4851427) (← links)
- Square-root RTS smoothing algorithms (Q4858852) (← links)
- Fast qz decomposition and its applications (Q4950616) (← links)
- Computationally efficient generation of Gaussian conditional simulations over regular sample grids (Q5935062) (← links)
- Globally optimal univariate spline approximations (Q6097760) (← links)
