Peter Ohm

Peter Ohm

Auto-generated profile, based on publicly available information

Peter Ohm

RIKEN Center for Computational Science, Kobe, Japan

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

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

Representative Publications

View All Publications
1 January 2020 in SIAM Journal on Scientific Computing
Verified
Journal Article
Closed access
JAJ. H. Adler
J. H. Adler
FGF. J. Gaspar
F. J. Gaspar
XHX. Hu
X. Hu
POP. Ohm
P. Ohm
CRC. Rodrigo
C. Rodrigo
LZL. T. Zikatanov
L. T. Zikatanov
In this paper, we present block preconditioners for a stabilized discretization of the poroelastic equations developed in [C. Rodrigo, X. Hu, P. Ohm, J. Adler, F. Gaspar, and L. Zikatanov, Comput. ...

6 February 2025 in SIAM Review
Verified
Journal Article
Closed access
NMNicholas S. Moore
Nicholas S. Moore
ECEric C. Cyr
Eric C. Cyr
POPeter Ohm
Peter Ohm
CSChristopher M. Siefert
Christopher M. Siefert
RTRaymond S. Tuminaro
Raymond S. Tuminaro
Sparse matrix computations are ubiquitous in scientific computing. Given the recent interest in scientific machine learning, it is natural to ask how sparse matrix computations can leverage neural networks (NNs). Unfortunately, multilayer perceptron (MLP) NNs are typically not natural for either graph or sparse matrix computations. The issue lies with the fact that MLPs require fixed-sized inputs, while scientific applications generally generate sparse matrices with arbitrary dimensions and a wide range of different nonzero patterns (or matrix graph vertex interconnections). While convolutional NNs could possibly address matrix graphs where all vertices have the same number of nearest neighbors, a more general approach is needed for arbitrary sparse matrices, e.g., those arising from discretized partial differential equations on unstructured meshes. Graph neural networks (GNNs) are one such approach suitable to sparse matrices. The key idea is to define aggregation functions (e.g., summations) that operate on variable-size input data to produce data of a fixed output size so that MLPs can be applied. The goal of this paper is to provide an introduction to GNNs for a numerical linear algebra audience. Concrete GNN examples are provided to illustrate how many common linear algebra tasks can be accomplished using GNNs. We focus on iterative and multigrid methods that employ computational kernels such as matrix-vector products, interpolation, relaxation methods, and strength-of-connection measures. Our GNN examples include cases where parameters are determined a priori as well as cases where parameters must be learned. The intent of this paper is to help computational scientists understand how GNNs can be used to adapt machine learning concepts to computational tasks associated with sparse matrices. It is hoped that this understanding will further stimulate data-driven extensions of classical sparse linear algebra tasks.

23 August 2023 in Computer Methods in Applied Mechanics and Engineering
Verified
Journal Article
Closed access
JBJ. Bonilla
J. Bonilla
JSJ.N. Shadid
J.N. Shadid
XTX.-Z. Tang
X.-Z. Tang
MCM.M. Crockatt
M.M. Crockatt
POP. Ohm
P. Ohm
OBO. Beznosov
O. Beznosov

5 August 2023 in SeMA Journal
Verified
Journal Article
Open access
PDF file
CRCarmen Rodrigo
Carmen Rodrigo
FGFrancisco J. Gaspar
Francisco J. Gaspar
JAJames Adler
James Adler
XHXiaozhe Hu
Xiaozhe Hu
POPeter Ohm
Peter Ohm
LZLudmil Zikatanov
Ludmil Zikatanov
This work presents an overview of the most relevant results obtained by the authors regarding the numerical solution of the Biot’s consolidation problem by preconditioning techniques. The emphasis here is on the design of parameter-robust preconditioners for the efficient solution of the algebraic system of equations resulting after proper discretization of such poroelastic problems. The classical two- and three-field formulations of the problem are considered, and block preconditioners are presented for some of the discretization schemes that have been proposed by the authors for these formulations. These discretizations have been proved to be well-posed with respect to the physical and discretization parameters, what provides a framework to develop preconditioners that are robust with respect to such parameters as well. In particular, we construct both norm-equivalent (block diagonal) and field-of-value-equivalent (block triangular) preconditioners, which are proved to be parameter-robust. The theoretical results on this parameter-robustness are demonstrated by considering typical benchmark problems in the literature for Biot’s model.

5 July 2024 in SIAM Journal on Scientific Computing
Verified
Journal Article
Closed access
POPeter Ohm
Peter Ohm
JBJesus Bonilla
Jesus Bonilla
EPEdward Phillips
Edward Phillips
JSJohn N. Shadid
John N. Shadid
MCMichael Crockatt
Michael Crockatt
XTXian-Zhu Tang
Xian-Zhu Tang
This study investigates multiphysics block preconditioners that are critical in devising scalable Newton–Krylov iterative solvers for longer time-scale fully implicit fluid plasma models. The specific model of interest is the visco-resistive, low Mach number, compressible magnetohydrodynamics (MHD) model. This model describes the dynamics of conducting fluids in the presence of electromagnetic fields and can be used to study aspects of astrophysical phenomena, important science and technology applications, and basic plasma physics. The specific application of interest that motivates this study is the macroscopic simulation of longer time-scale stability and disruptions of magnetic confinement fusion devices, specifically the ITER Tokamak. The computational solution of the governing balance equations for mass, momentum, heat transfer, and magnetic induction for resistive MHD systems can be extremely challenging. These difficulties arise from both the strong nonlinear, nonsymmetric coupling of fluid and electromagnetic phenomena as well as the significant range of time and length scales that the interactions of these physical mechanisms produce. To handle the range of time and spatial scales of interest, a fully implicit unstructured variational multiscale finite element formulation is employed. For the scalable solution of the Newton linearized systems, fully coupled block preconditioners are designed to leverage algebraic multigrid subsolves. Results are presented for the strong and weak scaling of the method as well as the robustness of these techniques for a large range of Lundquist numbers.