José Penadés

Prof. Dr. José Penadés

orcid

Research Focus & Metrics

Academic Career Length

32Years (1995-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 September 1996 in Numerical Linear Algebra with Applications
Verified
Journal Article
Open access
PDF file
VMVioleta Migallón
Violeta Migallón
JPJosé Penadés
José Penadés
DSDaniel B. Szyld
Daniel B. Szyld
The use of block two-stage methods for the iterative solution of consistent singular linear systems is studied. In these methods, suitable for parallel computations, different blocks, i.e., smaller linear systems, can be solved concurrently by different processors. Each of these smaller systems are solved by an (inner) iterative method. Hypotheses are provided for the convergence of non-stationary methods, i.e., when the number of inner iterations may vary from block to block and from one outer iteration to another. It is shown that the iteration matrix corresponding to one step of the block method is convergent, i.e., that its powers converge to a limit matrix. A theorem on the convergence of the infinite product of matrices with the same eigenspace corresponding to the eigenvalue 1 is proved, and later used as a tool in the convergence analysis of the block method. The methods studied can be used to solve any consistent singular system, including discretizations of certain differential equations. They can also be used to find stationary probability distribution of Markov chains. This last application is considered in detail.

1 March 1999 in Numerische Mathematik
Verified
Journal Article
Closed access
PDF file
ZBZhong-Zhi Bai
Zhong-Zhi Bai
VMVioleta Migallón
Violeta Migallón
JPJosé Penadés
José Penadés
DSDaniel B. Szyld
Daniel B. Szyld

1 January 1998 in Mathematics of Computation
Verified
Journal Article
Open access
PDF file
MCM. Castel
M. Castel
VMVioleta Migallón
Violeta Migallón
JPJosé Penadés
José Penadés
Non-stationary multisplitting algorithms for the solution of linear systems are studied. Convergence of these algorithms is analyzed when the coefficient matrix of the linear system is hermitian positive definite. Asynchronous versions of these algorithms are considered and their convergence investigated.

1 May 1997 in Applied Mathematics Letters
Verified
Journal Article
Closed access
VMV. Migallón
V. Migallón
JPJosé Penadés
José Penadés

1 July 1996 in Linear Algebra and its Applications
Verified
Journal Article
Closed access
JMJosé Mas
José Mas
VMVioleta Migall'On
Violeta Migall'On
JPJosé Penadés
José Penadés
DSDaniel B. Szyld
Daniel B. Szyld

1 January 2001 in SIAM Journal on Matrix Analysis and Applications
Verified
Journal Article
Closed access
VMVioleta Migallón
Violeta Migallón
JPJosé Penadés
José Penadés
DSDaniel B. Szyld
Daniel B. Szyld
In the convergence theory of multisplittings for symmetric positive definite (s.p.d.) matrices it is usually assumed that the weighting matrices are scalar matrices, i.e., multiples of the identity. In this paper, this restrictive condition is eliminated. In its place it is assumed that more than one (inner) iteration is performed in each processor (or block). The theory developed here is applied to nonstationary multisplittings for s.p.d. matrices, as well as to two-stage multisplittings for symmetric positive semidefinite matrices.