Related papers: Krylov--Bogolyubov averaging
Existence of renormalized solutions to the two-dimensional Broadwell model with given indata in L1 is proven. Averaging techniques from the continuous velocity case being unavailable when the velocities are discrete, the approach is based…
We study the homogenization property of systems of quasi-linear PDEs of parabolic type with periodic coefficients, highly oscillating drift and highly oscillating nonlinear term. To this end, we propose a probabilistic approach based on the…
In this work, in the context of Linear and Quadratic Programming, we interpret Primal Dual Regularized Interior Point Methods (PDR-IPMs) in the framework of the Proximal Point Method. The resulting Proximal Stabilized IPM (PS-IPM) is…
For the first time, a globally convergent numerical method is presented for ill-posed Cauchy problems for quasilinear PDEs. The key idea is to use Carleman Weight Functions to construct globally strictly convex Tikhonov-like cost…
In this work, we have presented a simple analytical approximation scheme for generic non-linear FBSDEs. By treating the interested system as the linear decoupled FBSDE perturbed with non-linear generator and feedback terms, we have shown…
One of the most computationally expensive steps of the low-rank ADI method for large-scale Lyapunov equations is the solution of a shifted linear system at each iteration. We propose the use of the extended Krylov subspace method for this…
In this paper, we present estimates for solutions and for the attraction domain of the trivial solution for systems with delayed and nonlinear weighted homogeneous right-hand side of positive degree. The results are achieved via a…
Krylov subspace methods are a powerful tool for efficiently solving high-dimensional linear algebra problems. In this work, we study the approximation quality that a Krylov subspace provides for estimating the numerical range of a matrix.…
Nowadays, many fields of study are have to deal with large and sparse data matrixes, but the most important issue is finding the inverse of these matrixes. Thankfully, Krylov subspace methods can be used in solving these types of problem.…
Extensions of the Hartree-Fock-Bogoliubov theory are worked out which are tailored for, (i) the consistent evaluation of fluctuations and correlations and (ii) the restoration through projection of broken symmetries. For both purposes we…
We tackle the problem of building adaptive estimation procedures for ill-posed inverse problems. For general regularization methods depending on tuning parameters, we construct a penalized method that selects the optimal smoothing sequence…
We consider large systems of particles interacting through rough but bounded interaction kernels. We are able to control the relative entropy between the $N$-particle distribution and the expected limit which solves the corresponding Vlasov…
The Golub-Kahan-Tikhonov method is a popular solution technique for large linear discrete ill-posed problems. This method first applies partial Golub-Kahan bidiagonalization to reduce the size of the given problem and then uses Tikhonov…
The heat equation is often used in order to inpaint dropped data in inpainting-based lossy compression schemes. We propose an alternative way to numerically solve the heat equation by an extended Krylov subspace method. The method is very…
We consider Arnoldi like processes to obtain symplectic subspaces for Hamiltonian systems. Large systems are locally approximated by ones living in low dimensional subspaces; we especially consider Krylov subspaces and some extensions. This…
This work concerns about forward-backward multivalued stochastic systems. First of all, we prove one average principle for general stochastic differential equations in the $L^{2p}$ ($p\geq 1$) sense. Moreover, for $p=1$ a convergence rate…
For solving a wide class of nonconvex and nonsmooth problems, we propose a proximal linearized iteratively reweighted least squares (PL-IRLS) algorithm. We first approximate the original problem by smoothing methods, and second write the…
Krylov complexity measures operator growth with respect to a basis, which is adapted to the Heisenberg time evolution. The construction of that basis relies on the Lanczos algorithm, also known as the recursion method. The mathematics of…
This paper discusses model order reduction of large sparse second-order index-3 differential algebraic equations (DAEs) by applying Iterative Rational Krylov Algorithm (IRKA). In general, such DAEs arise in constraint mechanics, multibody…
In the analysis of PDEs, regularity of often measured in terms of Sobolev, H{\"o}lder, Besov or Lipschitz spaces, etc. However, sometimes a gain of regularity can also be expressed just in terms of Lebesgue spaces, by passing from a…