A generalization of the implicit LU algorithm to an arbitrary initial matrix

Author： Spedicato E.   Zhu M.  

Publisher： Springer Publishing Company

ISSN： 1017-1398

Source： Numerical Algorithms, Vol.20, Iss.4, 1999-08, pp. : 343-351

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

An algorithm for implicit interpolation

By Giménez Nardo  

Applicable Algebra in Engineering, Communication and Computing, Vol. 25, Iss. 1-2, 2014-04 ,pp. : 119-157

Springer Publishing Company

Access to resources Recommend Favorite

An Incremental Algorithm for a Generalization of the Shortest-Path Problem

By Ramalingam G.   Reps T.  

Journal of Algorithms, Vol. 21, Iss. 2, 1996-09 ,pp. : 267-305

Academic Press

Access to resources Recommend Favorite

MODIFIED KOVARIK ALGORITHM FOR APPROXIMATE ORTHOGONALIZATION OF ARBITRARY MATRICES

By POPA C.  

International Journal of Computer Mathematics, Vol. 80, Iss. 4, 2003-04 ,pp. : 519-525

Taylor & Francis Ltd

Access to resources Recommend Favorite

A fast algorithm for matrix balancing

By Knight Philip A.   Ruiz Daniel  

IMA Journal of Numerical Analysis, Vol. 33, Iss. 3, 2013-07 ,pp. : 1029-1047

Oxford University Press

Access to resources Recommend Favorite

Implicit QR for rank-structured matrix pencils

By Boito P.   Eidelman Y.   Gemignani L.  

Bit Numerical Mathematics, Vol. 54, Iss. 1, 2014-03 ,pp. : 85-111

Springer Publishing Company

Access to resources Recommend Favorite