English
Related papers

Related papers: Domain Decomposition Based High Performance Parall…

200 papers

The paper describes an improved parallel MPI-based implementation of VBARMS, a variable block variant of the pARMS preconditioner proposed by Li,~Saad and Sosonkina [NLAA, 2003] for solving general nonsymmetric linear systems. The parallel…

Numerical Analysis · Mathematics 2015-08-11 Bruno Carpentieri , Jia Liao , Masha Sosonkina , Aldo Bonfiglioli

In this paper, a parallel domain decomposition method is proposed for solving the fully-mixed Stokes-dual-permeability fluid flow model with Beavers-Joseph (BJ) interface conditions. Three Robin-type boundary conditions and a modified weak…

Numerical Analysis · Mathematics 2022-06-14 Zheng Li , Feng Shi , Yizhong Sun , Haibiao Zheng

Discrete Fracture Network models are largely used for very large scale geological flow simulations. For this reason numerical methods require an investigation of tools for efficient parallel solutions on High Performance Computing systems.…

Numerical Analysis · Mathematics 2021-06-21 Stefano Berrone , Alice Raeli

Solving the linear elasticity and Stokes equations by an optimal domain decomposition method derived algebraically involves the use of non standard interface conditions. The one-level domain decomposition preconditioners are based on the…

Numerical Analysis · Mathematics 2018-04-23 Gabriel R. Barrenechea , Michał Bosy , Victorita Dolean

This paper proposes a domain decomposition subspace neural network method for efficiently solving linear and nonlinear partial differential equations. By combining the principles of domain decomposition and subspace neural networks, the…

Numerical Analysis · Mathematics 2025-05-28 Zhenxing Fu , Hongliang Liu , Zhiqiang Sheng , Baixue Xing

In this paper, a parallel overlapping domain decomposition preconditioner is proposed to solve the linear system of equations arising from the extended finite element discretization of elastic crack problems. The algorithm partitions the…

Computational Engineering, Finance, and Science · Computer Science 2021-12-07 Tian Wei , Huang Jingjing , Chen Rongliang , Jiang Yi

A fast algorithm for the approximation of a low rank LU decomposition is presented. In order to achieve a low complexity, the algorithm uses sparse random projections combined with FFT-based random projections. The asymptotic approximation…

Numerical Analysis · Mathematics 2016-01-19 Yariv Aizenbud , Gil Shabat , Amir Averbuch

This work proposes a method for solving linear stochastic optimal control (SOC) problems using sum of squares and semidefinite programming. Previous work had used polynomial optimization to approximate the value function, requiring a high…

Optimization and Control · Mathematics 2014-09-23 Matanya B. Horowitz , Ivan Papusha , Joel W. Burdick

In this paper, an efficient parallel splitting method is proposed for the optimal control problem with parabolic equation constraints. The linear finite element is used to approximate the state variable and the control variable in spatial…

Optimization and Control · Mathematics 2023-02-21 Haiming Song , Jiachuan Zhang , Yongle Hao

Partial differential equations (PDE) often involve parameters, such as viscosity or density. An analysis of the PDE may involve considering a large range of parameter values, as occurs in uncertainty quantification, control and…

Numerical Analysis · Mathematics 2017-09-28 Max Gunzburger , Nan Jiang , Michael Schneier

This paper presents a parallel preconditioning method for distributed sparse linear systems, based on an approximate inverse of the original matrix, that adopts a general framework of distributed sparse matrices and exploits the domain…

Numerical Analysis · Computer Science 2015-06-02 Ruipeng Li , Yousef Saad

The goal of this work is to present a fast and viable approach for the numerical solution of the high-contrast state problems arising in topology optimization. The optimization process is iterative, and the gradients are obtained by an…

Numerical Analysis · Mathematics 2020-06-25 Miguel Zambrano , Sintya Serrano , Boyan S. Lazarov , Juan Galvis

Domain decomposition methods are widely used to solve sparse linear systems from scientific problems, but they are not suited to solve sparse linear systems extracted from integrated circuits. The reason is that the sparse linear system of…

Computational Engineering, Finance, and Science · Computer Science 2011-03-15 Fei Wei , Huazhong Yang

High-dimensional sparse data emerge in many critical application domains such as healthcare and cybersecurity. To extract meaningful insights from massive volumes of these multi-dimensional data, scientists employ unsupervised analysis…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-03-18 Jan Laukemann , Ahmed E. Helal , S. Isaac Geronimo Anderson , Fabio Checconi , Yongseok Soh , Jesmin Jahan Tithi , Teresa Ranadive , Brian J Gravelle , Fabrizio Petrini , Jee Choi

We present a sparse linear system solver that is based on a multifrontal variant of Gaussian elimination, and exploits low-rank approximation of the resulting dense frontal matrices. We use hierarchically semiseparable (HSS) matrices, which…

Mathematical Software · Computer Science 2015-02-27 Pieter Ghysels , Xiaoye S. Li , Francois-Henry Rouet , Samuel Williams , Artem Napov

Solving sparse linear systems from discretized PDEs is challenging. Direct solvers have in many cases quadratic complexity (depending on geometry), while iterative solvers require problem dependent preconditioners to be robust and…

Numerical Analysis · Mathematics 2017-03-14 Kai Yang , Hadi Pouransari , Eric Darve

We present and analyze a parallel solver for the solution of fluid structure interaction problems described by a fictitious domain approach. In particular, the fluid is modeled by the non-stationary incompressible Navier-Stokes equations,…

Numerical Analysis · Mathematics 2024-02-07 Daniele Boffi , Fabio Credali , Lucia Gastaldi , Simone Scacchi

The use of deep learning methods for solving PDEs is a field in full expansion. In particular, Physical Informed Neural Networks, that implement a sampling of the physical domain and use a loss function that penalizes the violation of the…

Machine Learning · Computer Science 2021-12-08 Valentin Mercier , Serge Gratton , Pierre Boudier

A parallel direct solution approach based on domain decomposition method (DDM) and directed acyclic graph (DAG) scheduling is outlined. Computations are represented as a sequence of small tasks that operate on domains of DDM or dense matrix…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-02-13 Javad Moshfegh , Dimitrios G. Makris , Marinos N. Vouvakis

In this paper, we present a novel framework incorporating a combination of sparse models in different domains. We posit the observed data as generated from a linear combination of a sparse Gaussian Markov model (with a sparse precision…

Machine Learning · Computer Science 2012-07-03 Majid Janzamin , Animashree Anandkumar