Ismael Herrera
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Ismael Herrera has a total of 59 co-authors. Here are the top co-authors by number of shared publications:
Robert Yates
6 shared publicationsMichael A. Celia
Water Resources Program, Department of Civil Engineering and Operations Research, Princeton University, New Jersey 08544
4 shared publicationsR. Yates
Instituto de Geofı́sica, Universidad Nacional Autónoma de México (UNAM), Apartado Postal 22-582, 14000 México, DF, Mexico
3 shared publicationsAntonmaria Minzoni
2 shared publicationsEmigdio Z. Flores
2 shared publications- Ernesto Rubio Acosta
Universidad Nacional Autonoma de Mexico, Instituto de Investigaciones en Matematicas Aplicadas y en Sistemas, Mexico City, Mexico
2 shared publications
Latest Publications
- Open Access
- 29 December 2025
- Published by Universidad Nacional Autonoma de Mexico in Geofísica Internacional
- Vol. 65 (1) , 2037-2058
Review of the Domain Decomposition Method in the Derived-Vector Space DDM-DVS and its Applicability to Nonsymmetric Matrices
This paper examines the Domain Decomposition Method in the Derived Vector Space (DDM-DVS), introduced by Herrera I. and further developed in Herrera et al., (2014), extending its applicability to nonsymmetric matrices. The DDM-DVS or DVS framework, is a domain decomposition method with non-overlapping subdomains and non-overlapping subdomains nodes, differing from standard Iterative Substructuring Methods, in which boundary nodes between subdomains are overlapping. The discretized problem is approached in an extended vector space known as the Derived Vector Space (DVS), where the system matrix is structured as a block diagonal matrix, enabling efficient high-performance parallel computing. This structure allows each processor to solve a single subdomain independently. This work contributes to the DVS framework introducing the DVS-Schur and DVS-BDDC methods, employing BiCGstab as the global solver. These methods operated in three levels: globally solving for dual nodes, globally solving for primal nodes, and locally solving for nodes inside (internal) the subdomains. It is demonstrated that the Schur complement of the system matrix is also block diagonal. The paper establishes the equivalence of the discretized problem through standard methods and within the DVS framework. The superlinear efficiency of the proposed algorithms is confirmed, with an analysis of their algorithmic complexity in relation to the ratio of dual to interior nodes. Additionally, the paper provides examples based on the general second-order differential operator, which is relevant in Earth Sciences for modeling the steady state of the transport equation. Systems with up to 100 million degrees of freedom were successfully solved using as many as 441 processors.
- 29 December 2025
- Published by Universidad Nacional Autonoma de Mexico in Geofísica Internacional
- Vol. 65 (1) , 2037-2058
Open AccessReview of the Domain Decomposition Method in the Derived-Vector Space DDM-DVS and its Applicability to Nonsymmetric Matrices
This paper examines the Domain Decomposition Method in the Derived Vector Space (DDM-DVS), introduced by Herrera I. and further developed in Herrera et al., (2014), extending its applicability to nonsymmetric matrices. The DDM-DVS or DVS framework, is a domain decomposition method with non-overlapping subdomains and non-overlapping subdomains nodes, differing from standard Iterative Substructuring Methods, in which boundary nodes between subdomains are overlapping. The discretized problem is approached in an extended vector space known as the Derived Vector Space (DVS), where the system matrix is structured as a block diagonal matrix, enabling efficient high-performance parallel computing. This structure allows each processor to solve a single subdomain independently. This work contributes to the DVS framework introducing the DVS-Schur and DVS-BDDC methods, employing BiCGstab as the global solver. These methods operated in three levels: globally solving for dual nodes, globally solving for primal nodes, and locally solving for nodes inside (internal) the subdomains. It is demonstrated that the Schur complement of the system matrix is also block diagonal. The paper establishes the equivalence of the discretized problem through standard methods and within the DVS framework. The superlinear efficiency of the proposed algorithms is confirmed, with an analysis of their algorithmic complexity in relation to the ratio of dual to interior nodes. Additionally, the paper provides examples based on the general second-order differential operator, which is relevant in Earth Sciences for modeling the steady state of the transport equation. Systems with up to 100 million degrees of freedom were successfully solved using as many as 441 processors.
- Open Access
- 29 December 2025
- Published by Universidad Nacional Autonoma de Mexico in Geofísica Internacional
- Vol. 65 (1) , 2034-2035
Foreword to the thematic area: “Mathematical and Computational Geophysics”
Geofísica Internacional (GI) es una destacada revista científica mexicana que, desde su fundación en 1961, ha sido un pilar en la difusión de la investigación geofísica en América Latina y, cada vez más, en otras regiones del mundo. Se publica trimestralmente por la Universidad Nacional Autónoma de México (UNAM) a través de su Instituto de Geofísica. En los últimos años, GI ha experimentado una reestructuración profunda y con visión de futuro. Entre los cambios más relevantes destaca la implementación de una nueva organización editorial basada en Áreas Temáticas específicas.
- 29 December 2025
- Published by Universidad Nacional Autonoma de Mexico in Geofísica Internacional
- Vol. 65 (1) , 2034-2035
Open AccessForeword to the thematic area: “Mathematical and Computational Geophysics”
Geofísica Internacional (GI) es una destacada revista científica mexicana que, desde su fundación en 1961, ha sido un pilar en la difusión de la investigación geofísica en América Latina y, cada vez más, en otras regiones del mundo. Se publica trimestralmente por la Universidad Nacional Autónoma de México (UNAM) a través de su Instituto de Geofísica. En los últimos años, GI ha experimentado una reestructuración profunda y con visión de futuro. Entre los cambios más relevantes destaca la implementación de una nueva organización editorial basada en Áreas Temáticas específicas.
- Open Access
The Divide-and-Conquer Framework: A Suitable Setting for the DDM of the Future
This paper was prompted by numerical experiments we performed, in which algorithms already available in the literature (DVS-BDDM) yielded accelerations (or speedups) many times larger (more than seventy in some examples already treated, but probably often much larger) than the number of processors used. Based on these outstanding results, here it is shown that believing in the standard ideal speedup, which is taken to be equal to the number of processors, has limited much the performance goal sought by research on domain decomposition methods (DDM) and has hindered much its development, thus far. Hence, an improved theory in which the speedup goal is based on the Divide and Conquer algorithmic paradigm, frequently considered as the leitmotiv of domain decomposition methods, is proposed as a suitable setting for the DDM of the future.
Open AccessThe Divide-and-Conquer Framework: A Suitable Setting for the DDM of the Future
This paper was prompted by numerical experiments we performed, in which algorithms already available in the literature (DVS-BDDM) yielded accelerations (or speedups) many times larger (more than seventy in some examples already treated, but probably often much larger) than the number of processors used. Based on these outstanding results, here it is shown that believing in the standard ideal speedup, which is taken to be equal to the number of processors, has limited much the performance goal sought by research on domain decomposition methods (DDM) and has hindered much its development, thus far. Hence, an improved theory in which the speedup goal is based on the Divide and Conquer algorithmic paradigm, frequently considered as the leitmotiv of domain decomposition methods, is proposed as a suitable setting for the DDM of the future.
- 1 January 2016
- Published by Begell House Inc. Publishers in International Journal for Multiscale Computational Engineering
- Vol. 14 (2) , 135-148
A SYSTEMATIC FORMULATION OF MULTIPHYSICS SYSTEMS AND ITS APPLICATIONS TO BOUNDARY LAYERS AND SHOCK PROFILES
In this paper an axiomatic formulation of a general class of multiphysical systems is introduced. On the other hand, two of the most typical applications of multiscale modeling are: capturing macroscale behavior and resolving local-events, which are governed by finer models. Then the axiomatic formulation mentioned above is used to establish a procedure for defining the boundary conditions and resolving systematically local-events. This yields a “bi-physical’ approach to resolving local-events, which here is applied to ‘boundary-layers’ and ‘shock-profiles’. Specific examples treated with the new method include boundary-layers occurring in advection-dominated transport and slightly viscous incompressible fluids, and internal layers occurring in the study of shocks of inviscid-compressible fluids.
- 1 January 2016
- Published by Begell House Inc. Publishers in International Journal for Multiscale Computational Engineering
- Vol. 14 (2) , 135-148
A SYSTEMATIC FORMULATION OF MULTIPHYSICS SYSTEMS AND ITS APPLICATIONS TO BOUNDARY LAYERS AND SHOCK PROFILES
In this paper an axiomatic formulation of a general class of multiphysical systems is introduced. On the other hand, two of the most typical applications of multiscale modeling are: capturing macroscale behavior and resolving local-events, which are governed by finer models. Then the axiomatic formulation mentioned above is used to establish a procedure for defining the boundary conditions and resolving systematically local-events. This yields a “bi-physical’ approach to resolving local-events, which here is applied to ‘boundary-layers’ and ‘shock-profiles’. Specific examples treated with the new method include boundary-layers occurring in advection-dominated transport and slightly viscous incompressible fluids, and internal layers occurring in the study of shocks of inviscid-compressible fluids.
- Open Access
- 1 January 2016
- Published by Universidad Nacional Autonoma de Mexico in Geofísica Internacional
- Vol. 55 (1)
An Innovative Tool for Effectively Applying Highly Parallelized Hardware To Problems of Elasticity
At present, the most efficient domain decomposition methods (DDM) are non-overlapping methods. The improved efficiency of such methods is due to the significant independence achieved by local problems when the subdomains are non-overlapping. However, standard discretizations applied up to now in non-overlapping DDMs use systems of nodes in which some of the nodes are shared by more than one subdomain of the domain decomposition. This is a limiting feature of the present state-of-the-art in these techniques and apparently further increases of the independence of local problems should be expected if this limiting characteristic was eliminated. In previous work, I. Herrera and co-workers have developed a new approach to domain decomposition methods: the ‘DVS framework’ that addresses this problem introducing a new discretization method, the ‘non-overlapping discretization method’, in which a non-overlapping system of nodes is used in the discrete formulation of the problem. Although the DVS algorithms have already been developed significantly, to profit from such advances it is essential to have available effective codes that permit their efficient implementation. As a further contribution in this line of research, in this paper we present and test software of such characteristics. The results here reported indicate that the DVS algorithms are very suitable for developing software that permits to apply effectively the most advanced hardware in parallel available at present to the solution of partial differential equations. Although the software here reported specifically treats static elasticity only, the DVS-algorithms are very eclectic and can be applied to a great diversity of problems after they have been discretized. Additional research work is being carried out oriented to develop general purpose codes based on the DVS algorithms.
- 1 January 2016
- Published by Universidad Nacional Autonoma de Mexico in Geofísica Internacional
- Vol. 55 (1)
Open AccessAn Innovative Tool for Effectively Applying Highly Parallelized Hardware To Problems of Elasticity
At present, the most efficient domain decomposition methods (DDM) are non-overlapping methods. The improved efficiency of such methods is due to the significant independence achieved by local problems when the subdomains are non-overlapping. However, standard discretizations applied up to now in non-overlapping DDMs use systems of nodes in which some of the nodes are shared by more than one subdomain of the domain decomposition. This is a limiting feature of the present state-of-the-art in these techniques and apparently further increases of the independence of local problems should be expected if this limiting characteristic was eliminated. In previous work, I. Herrera and co-workers have developed a new approach to domain decomposition methods: the ‘DVS framework’ that addresses this problem introducing a new discretization method, the ‘non-overlapping discretization method’, in which a non-overlapping system of nodes is used in the discrete formulation of the problem. Although the DVS algorithms have already been developed significantly, to profit from such advances it is essential to have available effective codes that permit their efficient implementation. As a further contribution in this line of research, in this paper we present and test software of such characteristics. The results here reported indicate that the DVS algorithms are very suitable for developing software that permits to apply effectively the most advanced hardware in parallel available at present to the solution of partial differential equations. Although the software here reported specifically treats static elasticity only, the DVS-algorithms are very eclectic and can be applied to a great diversity of problems after they have been discretized. Additional research work is being carried out oriented to develop general purpose codes based on the DVS algorithms.
- Open Access
- 28 January 2014
- Published by Wiley in Numerical Methods for Partial Differential Equations
- Vol. 30 (5) , 1427-1454
Nonoverlapping discretization methods for partial differential equations
Ideally, domain decomposition methods (DDMs) seek what we call the DDM‐paradigm: “constructing the ‘global' solution by solving ‘local' problems, exclusively”. To achieve it, it is essential to disconnect the subdomain problems. This explains in part the success of nonoverlapping DDMs. However, in this kind of methods, different subdomains are linked by interface nodes that are shared by several subdomains. Discretization procedures for partial differential equations of a new kind, in which each node belongs to one and only one coarse‐mesh subdomain, are here introduced and analyzed. A discretization method of this type was very successfully used to develop the derived vector‐space‐framework. Using it, it is possible to develop algorithms that satisfy the DDM‐paradigm. Other enhanced numerical and computational properties of them are also discussed. © 2014 The Authors. Numerical Methods for Partial Differential Equations Published by Wiley Periodicals, Inc. 30: 1427–1454, 2014
- 28 January 2014
- Published by Wiley in Numerical Methods for Partial Differential Equations
- Vol. 30 (5) , 1427-1454
Open AccessNonoverlapping discretization methods for partial differential equations
Ideally, domain decomposition methods (DDMs) seek what we call the DDM‐paradigm: “constructing the ‘global' solution by solving ‘local' problems, exclusively”. To achieve it, it is essential to disconnect the subdomain problems. This explains in part the success of nonoverlapping DDMs. However, in this kind of methods, different subdomains are linked by interface nodes that are shared by several subdomains. Discretization procedures for partial differential equations of a new kind, in which each node belongs to one and only one coarse‐mesh subdomain, are here introduced and analyzed. A discretization method of this type was very successfully used to develop the derived vector‐space‐framework. Using it, it is possible to develop algorithms that satisfy the DDM‐paradigm. Other enhanced numerical and computational properties of them are also discussed. © 2014 The Authors. Numerical Methods for Partial Differential Equations Published by Wiley Periodicals, Inc. 30: 1427–1454, 2014
- Open Access
- 1 July 2013
- Published by Universidad Nacional Autonoma de Mexico in Geofísica Internacional
- Vol. 52 (3) , 293-309
Parallel Algorithms for Computational Models of Geophysical Systems
Mathematical models of many geophysical systems are based on the computational processing of large-scale algebraic systems. The most advanced computational tools are based on massively parallel processors. The most effective software for solving partial differential equations in parallel intends to achieve the DDM-paradigm. A set of four algorithms, the DVS-algorithms, which achieve it, and of very general applicability, has recently been developed and here they are explained. Also, their application to problems that frequently occur in Geophysics is illustrated
- 1 July 2013
- Published by Universidad Nacional Autonoma de Mexico in Geofísica Internacional
- Vol. 52 (3) , 293-309
Open AccessParallel Algorithms for Computational Models of Geophysical Systems
Mathematical models of many geophysical systems are based on the computational processing of large-scale algebraic systems. The most advanced computational tools are based on massively parallel processors. The most effective software for solving partial differential equations in parallel intends to achieve the DDM-paradigm. A set of four algorithms, the DVS-algorithms, which achieve it, and of very general applicability, has recently been developed and here they are explained. Also, their application to problems that frequently occur in Geophysics is illustrated
- 1 March 2013
- Published by Elsevier in Engineering Analysis with Boundary Elements
- Vol. 37 (3) , 646-657
The derived-vector space framework and four general purposes massively parallel DDM algorithms
- 1 March 2013
- Published by Elsevier in Engineering Analysis with Boundary Elements
- Vol. 37 (3) , 646-657
The derived-vector space framework and four general purposes massively parallel DDM algorithms