9 results on '"incomplete decompositions"'
Search Results
2. BALANCED INCOMPLETE FACTORIZATION.
- Author
-
Bru, Rafael, Marín, José, Mas, Josí, and Tůma, M.
- Subjects
- *
MATHEMATICS , *FACTORIZATION , *SPARSE matrices , *ALGORITHMS , *MARTIN'S axiom , *NUMERICAL analysis - Abstract
In this paper we present a new incomplete factorization of a square matrix into triangular factors in which we get standard LU or LDLT factors (direct factors) and their inverses (inverse factors) at the same time. Algorithmically, we derive this method from the approach based on the Sherman-Morrison formula [R. Bru, J. Cerdán, J. Marín, and J. Mas, SIAM J. Sci. Comput., 25 (2003), pp. 701-715]. In contrast to the robust incomplete decomposition (RIF) algorithm [M. Benzi and M. Tůma, Numer. Linear Algebra Appl., 10 (2003), pp. 385-400] the direct and inverse factors here directly influence each other throughout the computation. Consequently, the algorithm to compute the approximate factors may mutually balance dropping in the factors and control their conditioning in this way. For the symmetric positive definite case, we derive the theory and present an algorithm for computing the incomplete LDLT factorization, and we discuss experimental results. We call this new approximate LDLT factorization the balanced incomplete factorization (BIF). Our experimental results confirm that this factorization is very robust and may be useful in solving difficult ill conditioned problems by preconditioned iterative methods. Moreover, the internal coupling of the computation of direct and inverse factors results in much shorter setup times (times to compute approximate decomposition) than RIF, a method of a similar and very high level of robustness. We also derive and present the theory for the general nonsymmetric case, but do not discuss its implementation. [ABSTRACT FROM AUTHOR]
- Published
- 2008
- Full Text
- View/download PDF
3. Incomplete Cholesky factorization
- Author
-
Hoang, Phuong Thao, Tůma, Miroslav, and Tichý, Petr
- Subjects
předpodmiňování ,incomplete decompositions ,neúplné faktorizace ,solving systems of linear equations ,Cholesky factorization ,řešení soustav lineárních rovnic ,Choleského rozklad ,preconditioning - Abstract
The thesis is about the incomplete Cholesky factorization and its va- riants, which are important for preconditioning a system with symmetric and positive definite matrix. Our main focus is on solving these systems, which arise in many technical applications and natural sciences, using preconditioned Con- jugate Gradients. Besides many other ways we can apply Cholesky factorization approximately, incompletely. In this thesis we study existence of the incomplete Cholesky factorization and we evaluate behaviour and potential of different vari- ants of the generic algorithm. 1
- Published
- 2018
4. Improved Balanced Incomplete Factorization
- Author
-
Miroslav Tu ring, José Marín, Rafael Bru, and José Luis Verdú Más
- Subjects
Sherman–Morrison formula ,Iterative method ,Linear system ,Incomplete decompositions ,Sherman–Morrison formula, nonsymmetric matrices ,Nonsymmetric matrices ,Inverse ,Approximate inverses ,Preconditioned iterative methods ,Factorization ,Algorithmics ,Sparse matrices ,Linear algebra ,MATEMATICA APLICADA ,Algorithm ,Analysis ,Mathematics ,Sparse matrix - Abstract
[EN] . In this paper we improve the BIF algorithm which computes simultaneously the LU factors (direct factors) of a given matrix and their inverses (inverse factors). This algorithm was introduced in [R. Bru, J. Mar´ın, J. Mas, and M. T˚uma, SIAM J. Sci. Comput., 30 (2008), pp. 2302– 2318]. The improvements are based on a deeper understanding of the inverse Sherman–Morrison (ISM) decomposition, and they provide a new insight into the BIF decomposition. In particular, it is shown that a slight algorithmic reformulation of the basic algorithm implies that the direct and inverse factors numerically influence each other even without any dropping for incompleteness. Algorithmically, the nonsymmetric version of the improved BIF algorithm is formulated. Numerical experiments show very high robustness of the incomplete implementation of the algorithm used for preconditioning nonsymmetric linear systems, Received by the editors January 26, 2009; accepted for publication (in revised form) by V. Simoncini June 1, 2010; published electronically August 12, 2010. This work was supported by Spanish grant MTM 2007-64477, by project IAA100300802 of the Grant Agency of the Academy of Sciences of the Czech Republic, and partially also by the International Collaboration Support M100300902 of AS CR.
- Published
- 2010
- Full Text
- View/download PDF
5. Preconditioners based on the ISM factorization
- Author
-
Rafael Bru, Miroslav Tůma, José Luis Verdú Más, Juana Cerdán, and José Marín
- Subjects
Czech ,Sherman–Morrison formula ,Sherman-Morrison formula ,Incomplete decompositions ,Approximate inverses ,language.human_language ,Algebra ,Preconditioned iterative methods ,Work (electrical) ,Factorization ,Agency (sociology) ,Sparse matrices ,language ,General Materials Science ,MATEMATICA APLICADA ,Mathematics ,Sparse matrix - Abstract
In this paper we survey our work on preconditioners based on the Inverse Sherman-Morrison factorization. The most important theoretical results are also summarized and some numerical conclusions are provided., This work was supported by the Spanish Ministerio de Economia y Competitividad under grant MTM2014-58159-P and by the project 13-06684S of the Grant Agency of the Czech Republic.
- Published
- 2015
6. Preconditioners based on the ISM factorization
- Author
-
Universitat Politècnica de València. Escuela Técnica Superior de Gestión en la Edificación - Escola Tècnica Superior de Gestió en l'Edificació, Universitat Politècnica de València. Escuela Técnica Superior de Ingeniería Agronómica y del Medio Natural - Escola Tècnica Superior d'Enginyeria Agronòmica i del Medi Natural, Ministerio de Economía y Competitividad, Czech Grant Agency, Bru García, Rafael, Cerdán Soriano, Juana Mercedes, Marín Mateos-Aparicio, José, Mas Marí, José, Tuma, Miroslav, Universitat Politècnica de València. Escuela Técnica Superior de Gestión en la Edificación - Escola Tècnica Superior de Gestió en l'Edificació, Universitat Politècnica de València. Escuela Técnica Superior de Ingeniería Agronómica y del Medio Natural - Escola Tècnica Superior d'Enginyeria Agronòmica i del Medi Natural, Ministerio de Economía y Competitividad, Czech Grant Agency, Bru García, Rafael, Cerdán Soriano, Juana Mercedes, Marín Mateos-Aparicio, José, Mas Marí, José, and Tuma, Miroslav
- Abstract
In this paper we survey our work on preconditioners based on the Inverse Sherman-Morrison factorization. The most important theoretical results are also summarized and some numerical conclusions are provided.
- Published
- 2015
7. Preconditioned iterative methods for solving linear least squares problems
- Author
-
Universitat Politècnica de València. Departamento de Matemática Aplicada - Departament de Matemàtica Aplicada, Czech Science Foundation, Ministerio de Ciencia e Innovación, Bru García, Rafael, Marín Mateos-Aparicio, José, Mas Marí, José, Tuma, Miroslav, Universitat Politècnica de València. Departamento de Matemática Aplicada - Departament de Matemàtica Aplicada, Czech Science Foundation, Ministerio de Ciencia e Innovación, Bru García, Rafael, Marín Mateos-Aparicio, José, Mas Marí, José, and Tuma, Miroslav
- Abstract
New preconditioning strategies for solving m × n overdetermined large and sparse linear least squares problems using the conjugate gradient for least squares (CGLS) method are described. First, direct preconditioning of the normal equations by the balanced incomplete factorization (BIF) for symmetric and positive definite matrices is studied, and a new breakdown-free strategy is proposed. Preconditioning based on the incomplete LU factors of an n × n submatrix of the system matrix is our second approach. A new way to find this submatrix based on a specific weighted transversal problem is proposed. Numerical experiments demonstrate different algebraic and implementational features of the new approaches and put them into the context of current progress in preconditioning of CGLS. It is shown, in particular, that the robustness demonstrated earlier by the BIF preconditioning strategy transfers into the linear least squares solvers and the use of the weighted transversal helps to improve the LU-based approach.
- Published
- 2014
8. Improved balanced incomplete factorization
- Author
-
Universitat Politècnica de València. Departamento de Matemática Aplicada - Departament de Matemàtica Aplicada, Czech Academy of Sciences, Ministerio de Educación y Ciencia, Bru García, Rafael, Marín Mateos-Aparicio, José, Mas Marí, José, Tuma, Miroslav, Universitat Politècnica de València. Departamento de Matemática Aplicada - Departament de Matemàtica Aplicada, Czech Academy of Sciences, Ministerio de Educación y Ciencia, Bru García, Rafael, Marín Mateos-Aparicio, José, Mas Marí, José, and Tuma, Miroslav
- Abstract
[EN] . In this paper we improve the BIF algorithm which computes simultaneously the LU factors (direct factors) of a given matrix and their inverses (inverse factors). This algorithm was introduced in [R. Bru, J. Mar´ın, J. Mas, and M. T˚uma, SIAM J. Sci. Comput., 30 (2008), pp. 2302– 2318]. The improvements are based on a deeper understanding of the inverse Sherman–Morrison (ISM) decomposition, and they provide a new insight into the BIF decomposition. In particular, it is shown that a slight algorithmic reformulation of the basic algorithm implies that the direct and inverse factors numerically influence each other even without any dropping for incompleteness. Algorithmically, the nonsymmetric version of the improved BIF algorithm is formulated. Numerical experiments show very high robustness of the incomplete implementation of the algorithm used for preconditioning nonsymmetric linear systems
- Published
- 2010
9. On truncated incomplete decompositions
- Author
-
Wittum, Gabriel and Liebau, Frank
- Published
- 1989
- Full Text
- View/download PDF
Catalog
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.