Results 11 to 20 of about 1,481 (288)
Algorithms, 2017 A modification to an existing iterative method for computing zeros with unknown multiplicities of nonlinear equations or a system of nonlinear equations is presented.
Fayyaz Ahmad +6 more
doaj +1 more source
Refined saddle-point preconditioners for discretized Stokes problems [PDF]
, 2016 This paper is concerned with the implementation of efficient solution algorithms for elliptic problems with constraints. We establish theory which shows that including a simple scaling within well-established block diagonal preconditioners for Stokes ...
Silvester, David J. +8 more
core +1 more source
Fast interior point solution of quadratic programming problems arising from PDE-constrained optimization [PDF]
, 2017 Interior point methods provide an attractive class of approaches for solving linear, quadratic and nonlinear programming problems, due to their excellent efficiency and wide applicability.
Gondzio, Jacek +4 more
core +1 more source
Preconditioners for Krylov subspace methods : an overview [PDF]
, 2020 When simulating a mechanism from science or engineering, or an industrial process, one is frequently required to construct a mathematical model, and then resolve this model numerically. If accurate numerical solutions are necessary or desirable, this can
John W. Pearson +4 more
core +1 more source
An Optimal Block Iterative Method and Preconditioner for Banded Matrices with Applications to PDEs on Irregular Domains [PDF]
SIAM Journal on Matrix Analysis and Applications, 2012 Classical Schwarz methods and preconditioners subdivide the domain of a PDE into subdomains and use Dirichlet transmission conditions at the artificial interfaces. Optimized Schwarz methods use Robin (or higher order) transmission conditions instead, and the Robin parameter can be optimized so that the resulting iterative method has an optimized ...
Martin J. Gander +2 more
openaire +4 more sources
Вестник КазНУ. Серия математика, механика, информатика, 2020 This article is devoted to the construction and study of the finite element method for solving a two-dimensional nonlinear equation of elliptic type.
D.R. Baigereyev +2 more
doaj +1 more source
Performance of relaxed iterative methods for image deblurring problems
Journal of Algorithms & Computational Technology, 2019 In this paper, we consider performance of relaxation iterative methods for four types of image deblurring problems with different regularization terms.
Jae H Yun
doaj +1 more source
Abstract robust coarse spaces for systems of PDEs via generalized eigenproblems in the overlaps [PDF]
, 2013 Coarse spaces are instrumental in obtaining scalability for domain decomposition methods for partial differential equations (PDEs). However, it is known that most popular choices of coarse spaces perform rather weakly in the presence of heterogeneities ...
Hauret, P. +12 more
core +1 more source
A Modified SSOR Preconditioning Strategy for Helmholtz Equations
Journal of Applied Mathematics, 2012 The finite difference method discretization of Helmholtz equations usually leads to the large spare linear systems. Since the coefficient matrix is frequently indefinite, it is difficult to solve iteratively.
Shi-Liang Wu, Cui-Xia Li
doaj +1 more source
Mathematical and Computational Applications, 2023 Total fractional-order variation (TFOV) in image deblurring problems can reduce/remove the staircase problems observed with the image deblurring technique by using the standard total variation (TV) model. However, the discretization of the Euler–Lagrange
Adel M. Al-Mahdi
doaj +1 more source