Results 21 to 30 of about 10,608 (327)

Regularizing Inverse Preconditioners for Symmetric Band Toeplitz Matrices

open access: yesEURASIP Journal on Advances in Signal Processing, 2007
Image restoration is a widely studied discrete ill-posed problem. Among the many regularization methods used for treating the problem, iterative methods have been shown to be effective.
O. Menchi, G. Lotti, P. Favati
doaj   +2 more sources

A preconditioned iterative method for coupled fractional partial differential equation in European option pricing

open access: yesOpen Mathematics, 2023
Recently, regime-switching option pricing based on fractional diffusion models has been used, which explains many significant empirical facts about financial markets better.
Wu Shuang   +3 more
doaj   +1 more source

Aggregating distributed energy resources for grid flexibility services: A distributed game theoretic approach

open access: yesInternational Journal of Robust and Nonlinear Control, EarlyView., 2023
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

Block-iterative frequency-domain methods for Maxwell's equations in a planewave basis.

open access: yesOptics Express, 2001
We describe a fully-vectorial, three-dimensional algorithm to compute the definite-frequency eigenstates of Maxwell's equations in arbitrary periodic dielectric structures, including systems with anisotropy (birefringence) or magnetic materials, using ...
Steven G. Johnson, J. Joannopoulos
semanticscholar   +1 more source

Book reviews

open access: yesJournal of Numerical Analysis and Approximation Theory, 2023
Book review for: Gabriele Ciaramella, Martin J. Gander, Iterative Methods and Preconditioners for Systems of Linear Equations, SIAM, Philadelphia, 2022, X + 275 pp., ISBN 978-1-611976-89-2 (paperback), ISBN 978-1-61197-690-8 (ebook).
jnaat
doaj  

Analysis of Monte Carlo accelerated iterative methods for sparse linear systems

open access: yesNumerical Linear Algebra with Applications, 2017
We consider hybrid deterministic‐stochastic iterative algorithms for the solution of large, sparse linear systems. Starting from a convergent splitting of the coefficient matrix, we analyze various types of Monte Carlo acceleration schemes applied to the
M. Benzi   +4 more
semanticscholar   +1 more source

Regularization Preconditioners for Frame-Based Image Deblurring with Reduced Boundary Artifacts [PDF]

open access: yesSIAM Journal on Scientific Computing, 2015
Thresholding iterative methods were recently successfully applied to image deblurring problems. In this paper, we investigate the modified linearized Bregman algorithm (MLBA) used in image deblurring problems, with a proper treatment of the boundary ...
Yuantao Cai   +3 more
semanticscholar   +1 more source

Block regularization Kaczmarz method

open access: yesVestnik Samarskogo Gosudarstvennogo Tehničeskogo Universiteta. Seriâ: Fiziko-Matematičeskie Nauki, 2016
This article focuses on the modification of the iterative version of Kaczmarz block algorithm for solving the problem of regularization, which is a fairly effective method for large-scale problems.
Ekaterina Yu Bogdanova
doaj   +1 more source

On single-step HSS iterative method with circulant preconditioner for fractional diffusion equations [PDF]

open access: yesAdvances in Difference Equations, 2019
AbstractBy exploiting Toeplitz-like structure and non-Hermitian dense property of the discrete coefficient matrix, a new double-layer iterative method called SHSS-PCG method is employed to solve the linear systems originating from the implicit finite difference discretization of fractional diffusion equations (FDEs).
Mu-Zheng Zhu, Guo-Feng Zhang, Ya-E Qi
openaire   +3 more sources

A comparison theorem for the iterative method with the preconditioner (I+Smax)

open access: yesJournal of Computational and Applied Mathematics, 2002
The authors propose the preconditioner \(P_m=I+S_{\max}\) where \(S_{\max}\) is contructed by using only the largest element of each row of the upper triangular part of the nonsingular diagonally dominant \(\mathbb Z\)-matrix \(A\), that is, \(S_{\max}=(s_{ij}^m)=-a_{ik_i}\) for \(i=1,2,\ldots,n-1\), \(j>i\), and \(0\) otherwise, where \(k_i=\min j\in\{
Kotakemori, Hisashi   +3 more
openaire   +2 more sources

Home - About - Disclaimer - Privacy