[EN] Computational electromagnetics based on the solution of the integral form of Maxwell s
equations with boundary element methods require the solution of large and dense linear
systems. For large-scale problems the ...
[EN] An approximate inverse LU preconditioner is constructed based on the Sherman-Morrison formula. Applying recursively that inversion formula a multiplicative decomposition of the inverse of a matrix is obtained. This ...
[EN] We consider the numerical solution of linear systems arising from computational electromagnetics applications. For large scale problems the solution is usually obtained iteratively with a Krylov subspace method. It ...
Marín Mateos-Aparicio, José; Mas Marí, José(Springer-Verlag, 2023-01)
[EN] In this work we study pivoting strategies for the preconditioner presented in Bru (SIAM J Sci Comput 30(5):2302-2318, 2008) which computes the LU factorization of a matrix A. This preconditioner is based on the Inverse ...
Cerdán Soriano, Juana Mercedes; Faraj El Guelei, Táher; Malla Martínez, Natalia; Marín Mateos-Aparicio, José; Mas Marí, José(KENT STATE UNIVERSITY, ETNA, DEPT MATHEMATICS & COMPUTER SCIENCE, KENT, USA, OH, 44242-0001, 2010)
[EN] In this paper block approximate inverse preconditioners to solve sparse nonsymmetric linear systems
with iterative Krylov subspace methods are studied. The computation of the preconditioners involves consecutive
updates ...
[EN] In this paper, preconditioners for the conjugate gradient method are studied to solve the Newton system with symmetric positive definite Jacobian. In particular, we define a sequence of preconditioners built by means ...
Bru García, Rafael; Marín Mateos-Aparicio, José; Mas Marí, José; Tuma, Miroslav(Society for Industrial and Applied Mathematics, 2010)
[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, ...
[EN] Let Ax = b be a large and sparse system of linear equations where A is a nonsingular matrix. An approximate solution is frequently obtained by applying preconditioned terations. Consider the matrix B = A + PQT where ...
Guerrero Flores, Danny Joel(Universitat Politècnica de València, 2018-07-02)
El tema principal de esta tesis es el desarrollo de técnicas de actualización de precondicionadores para resolver sistemas lineales de gran tamaño y dispersos Ax=b mediante el uso de métodos iterativos de Krylov. Se ...
Mas Marí, José; Marín Mateos-Aparicio, José(Universitat Politècnica de València, 2022-07-15)
[EN] In this work we study pivoting strategies for the preconditioner presented Balanced Incomplete Preconditioner (SIAM J
Sci Comput 30(5):2302¿2318, 2008) which computes the LU factorization of a matrix A. We present a ...
Bru García, Rafael; Marín Mateos-Aparicio, José; Mas Marí, José; Tuma, Miroslav(Society for Industrial and Applied Mathematics, 2014)
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 ...
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.
Cerdán Soriano, Juana Mercedes; Guerrero-Flores, Danny Joel; Marín Mateos-Aparicio, José; Mas Marí, José(Elsevier, 2018-12-01)
[EN] We present a preconditioning technique for solving nonsymmetric linear systems Ax = b, where the coefficient matrix A has a skew-symmetric part that can be well approximated with a skew-symmetric low-rank matrix. The ...
[EN] In this paper we present a method for computing sparse preconditioners for iteratively solving rank deficient least squares problems (LS) by the LSMR method. The main idea of the method proposed is to update an ...
Marín Mateos-Aparicio, José; Mas Marí, José; Guerrero-Flores, Danny Joel; Hayami, K.(Springer-Verlag, 2017)
[EN] In this paper, we analyze how to update incomplete Cholesky preconditioners to solve least squares problems using iterative methods when the set of linear relations is updated with some new information, a new variable ...