Related papers: Formalization of Asymptotic Convergence for Statio…
Aitken extrapolation normally applied to convergent fixed point iteration is extended to extrapolate the solution of a divergent iteration. In addition, higher order Aitken extrapolation is introduced that enables successive decomposition…
We use the adjoint methods to study the static Hamilton-Jacobi equations and to prove the speed of convergence for those equations. The main new ideas are to introduce adjoint equations corresponding to the formal linearizations of…
An adaptive regularization strategy for stabilizing Newton-like iterations on a coarse mesh is developed in the context of adaptive finite element methods for nonlinear PDE. Existence, uniqueness and approximation properties are known for…
In this paper, we introduce a new iterative method which we call one step back approach: the main idea is to anticipate the consequence of the iterative computation per coordinate and to optimize on the choice of the sequence of the…
For a class of linear elliptic equations of general type with rapidly oscillating coefficients, we use the sigma-convergence method to prove the homogenization result and a corrector-type result. In the case of asymptotic periodic…
We consider a method for the approximation of iterated stochastic integrals of arbitrary multiplicity $k$ $(k\in \mathbb{N})$ with respect to the infinite-dimensional $Q$-Wiener process using the mean-square approximation method of iterated…
In this paper we apply methods of proof mining to obtain a highly uniform effective rate of asymptotic regularity for the Ishikawa iteration associated to nonexpansive self-mappings of convex subsets of a class of uniformly convex geodesic…
In this article we present a method for formally proving the correctness of the lazy algorithms for computing homographic and quadratic transformations -- of which field operations are special cases-- on a representation of real numbers by…
We propose a gradient-based Jacobi algorithm for a class of maximization problems on the unitary group, with a focus on approximate diagonalization of complex matrices and tensors by unitary transformations. We provide weak convergence…
Network structures are reconstructed from dynamical data by respectively naive mean field (nMF) and Thouless-Anderson-Palmer (TAP) approximations. For TAP approximation, we use two methods to reconstruct the network: a) iteration method; b)…
Asymptotic approximations to the zeros of Jacobi polynomials are given, with methods to obtain the coefficients in the expansions. These approximations can be used as standalone methods for the non-iterative computation of the nodes of…
In this paper we propose a new class of iterative regularization methods for solving ill-posed linear operator equations. The prototype of these iterative regularization methods is in the form of second order evolution equation with a…
We study the long time behavior of isentropic compressible Euler equations with linear damping driven by a white-in-time noise, on a one-dimensional torus. We prove the existence of a statistically stationary solution in the class of weak…
In [7], a new iterative method for solving linear system of equations was presented which can be considered as a modification of the Gauss-Seidel method. Then in [4] a different approach, say 2D-DSPM, and more effective one was introduced.…
Given a full column rank matrix $A \in \mathbb{R}^{m\times n}$ ($m\geq n$), we consider a special class of linear systems of the form $A^\top Ax=A^\top b+c$ with $x, c \in \mathbb{R}^{n}$ and $b \in \mathbb{R}^{m}$. The occurrence of $c$ in…
Incremental gradient and incremental proximal methods are a fundamental class of optimization algorithms used for solving finite sum problems, broadly studied in the literature. Yet, without strong convexity, their convergence guarantees…
For a singularly perturbed system of reaction--diffusion equations, assuming that the 0th order solutions in regular and singular regions are all stable, we construct matched asymptotic expansions for formal solutions to any desired order…
Aussel et al. (J Optim Theory Appl 170 818-837 2016) introduced the concept of projected solutions for the quasi-variational inequalities with a non-self constraint map, that is, the case where the constraint map may take values outside the…
Reduced-order modeling is an efficient approach for solving parameterized discrete partial differential equations when the solution is needed at many parameter values. An offline step approximates the solution space and an online step…
Solving the stationary nonlinear Fokker-Planck equations is important in applications and examples include the Poisson-Boltzmann equation and the two layer neural networks. Making use of the connection between the interacting particle…