Related papers: Nonlinear Krylov Acceleration Applied to a Discret…
This work introduces, analyzes and demonstrates an efficient and theoretically sound filtering strategy to ensure the condition of the least-squares problem solved at each iteration of Anderson acceleration. The filtering strategy consists…
In the present paper, we consider large scale nonsymmetric differential matrix Riccati equations with low rank right hand sides. These matrix equations appear in many applications such as control theory, transport theory, applied…
We construct a $K$-rough path above either a space-time or a spatial fractional Brownian motion, in any space dimension $d$. This allows us to provide an interpretation and a unique solution for the corresponding parabolic Anderson model,…
Although design optimization has shown its great power of automatizing the whole design process and providing an optimal design, using sophisticated computational models, its process can be formidable due to a computationally expensive…
A novel extension of the canonical solitonic mKdV equation is introduced which admits hybrid Ermakov-Painlev\'e II symmetry reduction. Application of the latter is made to obtain exact solution of Airy-type to a class of moving boundary…
Many computer graphics problems require computing geometric shapes subject to certain constraints. This often results in non-linear and non-convex optimization problems with globally coupled variables, which pose great challenge for…
In this paper, we propose an acceleration framework for a class of iterative methods using the Reduced Order Method (ROM). Assuming that the underlying iterative scheme generates a rich basis for the solution space, we construct the next…
In this paper, we consider Nesterov's Accelerated Gradient method for solving Nonlinear Inverse and Ill-Posed Problems. Known to be a fast gradient-based iterative method for solving well-posed convex optimization problems, this method also…
This paper aims at the efficient numerical solution of stochastic eigenvalue problems. Such problems often lead to prohibitively high dimensional systems with tensor product structure when discretized with the stochastic Galerkin method.…
A novel linear-algebraic algorithm, multiple Arnoldi method, was developed in an interdisciplinary study between physics and applied mathematics and realized one-hundred-million-atom (100-nm-scale) electronic state calculations on the K…
Solution methods for the nonlinear partial differential equation of the Rudin-Osher-Fatemi (ROF) and minimum-surface models are fundamental for many modern applications. Many efficient algorithms have been proposed. First order methods are…
In this paper, we propose a randomized accelerated method for the minimization of a strongly convex function under linear constraints. The method is of Kaczmarz-type, i.e. it only uses a single linear equation in each iteration. To obtain…
The parametric correlations of the transmission eigenvalues $T_i$ of a $N$-channel quantum scatterer are calculated assuming two different Brownian motion ensembles. The first one is the original ensemble introduced by Dyson and assumes an…
It is shown that the problem of balancing a nonnegative matrix by positive diagonal matrices can be recast as a constrained nonlinear multiparameter eigenvalue problem. Based on this equivalent formulation some adaptations of the power…
By employing a nonlinear quantum kicked rotor model, we investigate the transport of energy in multidimensional quantum chaos. Parallel numerical simulations and analytic theory demonstrate that the interplay between nonlinearity and…
A modified perturbation theory in the strength of the nonlinear term is used to solve the Nonlinear Schroedinger Equation with a random potential. It is demonstrated that in some cases it is more efficient than other methods. Moreover we…
In this work we consider the primal mixed variational formulation of the Poisson equation with a line source. The analysis and approximation of this problem is non-standard as the line source causes the solutions to be singular. We start by…
Considered herein is a modified Newton method for the numerical solution of nonlinear equations where the Jacobian is approximated using a complex-step derivative approximation. We show that this method converges for sufficiently small…
We offer an alternative viewpoint on Dyson's original paper regarding the application of Brownian motion to random matrix theory (RMT). In particular we show how one may use the same approach in order to study the stochastic motion in the…
Anderson Acceleration is a well-established method that allows to speed up or encourage convergence of fixed-point iterations. It has been successfully used in a variety of applications, in particular within the Self-Consistent Field (SCF)…