Results 31 to 40 of about 9,385 (270)
Robust Preconditioners for Incompressible MHD Models
In this paper, we develop two classes of robust preconditioners for the structure-preserving discretization of the incompressible magnetohydrodynamics (MHD) system.
Hu, Kaibo +3 more
core +1 more source
The cost of continuity: performance of iterative solvers on isogeometric finite elements [PDF]
In this paper we study how the use of a more continuous set of basis functions affects the cost of solving systems of linear equations resulting from a discretized Galerkin weak form.
Calo, V. M. +3 more
core +3 more sources
Preconditioned Dirichlet-Dirichlet Methods for Optimal Control of Elliptic PDE
The discretization of optimal control of elliptic partial differential equations problems yields optimality conditions in the form of large sparse linear systems with block structure. Correspondingly, when the solution method is a Dirichlet-Dirichlet non-
Loghin Daniel
doaj +1 more source
A New Hybrid Preconditioner for the Interior Point Method
This study aims to improve the computation of the search direction in the primal-dual Interior Point Method through preconditioned iterative methods. It is about a hybrid approach that combines the Controlled Cholesky Factorization preconditioner and ...
Manolo Rodriguez Heredia +2 more
doaj +1 more source
A Survey of Low-Rank Updates of Preconditioners for Sequences of Symmetric Linear Systems
The aim of this survey is to review some recent developments in devising efficient preconditioners for sequences of symmetric positive definite (SPD) linear systems A k x k = b k , k = 1 , … arising in many scientific applications, such as ...
Luca Bergamaschi
doaj +1 more source
A parallelizable preconditioner for the iterative solution of implicit Runge–Kutta-type methods
This article is concerned with the implementation of implicit Runge-Kutta (RK) methods such as those based on Gauss, Radon and Lobatto points applied to (stiff) ordinary differential equations. The use of a preconditioner, whose decomposition cost for parallel implementation is equivalent to the cost for the implicit-Euler method, is proposed.
Jay, Laurent O., Braconnier, Thierry
openaire +2 more sources
Krylov Subspace Solvers and Preconditioners
In these lecture notes an introduction to Krylov subspace solvers and preconditioners is presented. After a discretization of partial differential equations large, sparse systems of linear equations have to be solved.
Vuik C.
doaj +1 more source
On a computer implementation of the block Gauss-Seidel method for normal systems of equations
This article focuses on the modification of the block option Gauss-Seidel method for normal systems of equations, which is a sufficiently effective method of solving generally overdetermined, systems of linear algebraic equations of high dimensionality ...
Alexander I Bogdanova +1 more
doaj +1 more source
Abstract We propose a hierarchical energy management scheme for aggregating Distributed Energy Resources (DERs) for grid flexibility services. To prevent a direct participation of numerous prosumers in the wholesale electricity market, aggregators, as self‐interest agents in our scheme, incentivize prosumers to provide flexibility. We firstly model the
Xiupeng Chen +3 more
wiley +1 more source
Improved New Block Preconditioner for Solving 3 × 3 Block Saddle Point Problems
In order to overcome the computational challenges associated with block preconditioners for Krylov subspace methods, particularly those arising from Schur complement systems, this paper proposes an improved new block (INB) preconditioner for solving 3 ...
Xin-Hui Shao, Xin-Yang Liu
doaj +1 more source

