For large-scale eigenvalue problems the authors introduced in [4] a coarse grained parallel algorithm for distributed memory computers based on substructuring and static condensation. The approach can be generalized to non-nodal masters if the support of each of the generalized masters is contained in the interior of one substructure. In this note we demonstrate that modal masters are superior to interior nodal masters
This dissertation discusses parallel algorithms for the generalized eigenvalue problem Ax = λBx wher...
This talk discusses the computation of a small set of exterior eigenvalues of a large sparse matrix ...
Three multigrid algorithms are described that can solve the symmetric generalized eigenvalue problem...
For large-scale eigenvalue problems the authors introduced in [4] a coarse grained parallel algorith...
In the dynamic analysis of structures condensation methods are often used to reduce the number of de...
In the dynamic analysis of structures condensation methods are often used to reduce the number of de...
In the dynamic analysis of structures using finite element methods very often prohibitively many deg...
In the dynamic analysis of structures condensation methods are often used to reduce the number of de...
The dynamic analysis of structures leads to very large generalized eigenvalue problems. Their number...
We generalize the Guyan condensation of large symmetric eigenvalue problems to allow general degrees...
In this paper we study the algorithms and their parallel implementation for solving large-scale gene...
In the dynamic analysis of structures condensation methods are often used to reduce the number of de...
textThis thesis demonstrates an efficient parallel method of solving the generalized eigenvalue prob...
Appearing frequently in applications, generalized eigenvalue problems represent one of the core prob...
International audienceThis article proposes a method for solving generalized eigenvalue problems on ...
This dissertation discusses parallel algorithms for the generalized eigenvalue problem Ax = λBx wher...
This talk discusses the computation of a small set of exterior eigenvalues of a large sparse matrix ...
Three multigrid algorithms are described that can solve the symmetric generalized eigenvalue problem...
For large-scale eigenvalue problems the authors introduced in [4] a coarse grained parallel algorith...
In the dynamic analysis of structures condensation methods are often used to reduce the number of de...
In the dynamic analysis of structures condensation methods are often used to reduce the number of de...
In the dynamic analysis of structures using finite element methods very often prohibitively many deg...
In the dynamic analysis of structures condensation methods are often used to reduce the number of de...
The dynamic analysis of structures leads to very large generalized eigenvalue problems. Their number...
We generalize the Guyan condensation of large symmetric eigenvalue problems to allow general degrees...
In this paper we study the algorithms and their parallel implementation for solving large-scale gene...
In the dynamic analysis of structures condensation methods are often used to reduce the number of de...
textThis thesis demonstrates an efficient parallel method of solving the generalized eigenvalue prob...
Appearing frequently in applications, generalized eigenvalue problems represent one of the core prob...
International audienceThis article proposes a method for solving generalized eigenvalue problems on ...
This dissertation discusses parallel algorithms for the generalized eigenvalue problem Ax = λBx wher...
This talk discusses the computation of a small set of exterior eigenvalues of a large sparse matrix ...
Three multigrid algorithms are described that can solve the symmetric generalized eigenvalue problem...