相关论文: Three New Arnoldi-Type Methods for the Quadratic E…

Reduced-order models are central to motion planning and control of quadruped robots, yet existing templates are often hand-crafted for a specific locomotion modality. This motivates the need for automatic methods that extract task-specific,…

In this paper, we investigate the use of multilinear algebra for reducing the order of multidimensional linear time-invariant (MLTI) systems. Our main tools are tensor rational Krylov subspace methods, which enable us to approximate the…

In feedback flow control, one of the challenges is to develop mathematical models that describe the fluid physics relevant to the task at hand, while neglecting irrelevant details of the flow in order to remain computationally tractable. A…

Although Anderson acceleration (AA) is known to speed up fixed-point iterations, it is rarely applied in constrained optimization, in particular sequential quadratic programming (SQP). We show that the local convergence behavior of a…

In order to perform faster simulations, the model reduction is nowadays used in industrial contexts to solve large and complex problems. However, the efficiency of such an approach is sometimes cut by the interface size of the reduced model…

We propose the Adaptive Levenberg-Marquardt Third-Order Newton Method (ALMTON) for unconstrained nonconvex optimization, providing the first globally convergent realization of the unregularized third-order Newton method. Unlike the standard…

The five-dimensional quadrupole collective model based on energy density functionals (EDF) has often been employed to treat long-range correlations associated with shape fluctuations in nuclei. Our goal is to derive the collective inertial…

Circulant matrices play a central role in a recently proposed formulation of three-way data computations. In this setting, a three-way table corresponds to a matrix where each "scalar" is a vector of parameters defining a circulant. This…

Quantum subspace diagonalization (QSD) algorithms have emerged as a competitive family of algorithms that avoid many of the optimization pitfalls associated with parameterized quantum circuit algorithms. While the vast majority of the QSD…

In this paper, we compute the eigenvalue problem (EVP) for the semiclassical random Schr\"odinger operators, where the random potentials are parameterized by an infinite series of random variables. After truncating the series, we introduce…

We present a comparative study of the application of modern eigenvalue algorithms to an eigenvalue problem arising in quantum physics, namely, the computation of a few interior eigenvalues and their associated eigenvectors for the large,…

Ando's surface roughness model is applied to metallic nanowires and extended beyond small roughness size and infinite barrier limit approximations for the wavefunction overlaps, such as the Prange-Nee approximation. Accurate and fast…

We develop a procedure to implement the method of quadric ansatz to a class of second order partial differential equations (PDEs), which includes the four-dimensional K\"ahler-Einstein equation with symmetry and the one-sided type-D…

The eigenstate entanglement entropy has been recently shown to be a powerful tool to distinguish integrable from generic quantum-chaotic models. In integrable models, a unique feature of the average eigenstate entanglement entropy (over all…

Convex quadratic programs (QPs) constitute a fundamental computational primitive across diverse domains including financial optimization, control systems, and machine learning. The alternating direction method of multipliers (ADMM) has…

This contribution focuses on the development of Model Order Reduction (MOR) for one-way coupled steady state linear thermomechanical problems in a finite element setting. We apply Proper Orthogonal Decomposition (POD) for the computation of…

Improving sampling efficiency and generalization capability is critical for the successful data-driven control of quadrotor unmanned aerial vehicles (UAVs) that are inherently unstable. While various reinforcement learning (RL) approaches…

The expectation-maximization (EM) algorithm is a well-known iterative method for computing maximum likelihood estimates from incomplete data. Despite its numerous advantages, a main drawback of the EM algorithm is its frequently observed…

We propose a non-intrusive, Autoencoder-based framework for reduced-order modeling in continuum mechanics. Our method integrates three stages: (i) an unsupervised Autoencoder compresses high-dimensional finite element solutions into a…

The ability to efficiently solve topology optimization problems is of great importance for many practical applications. Hence, there is a demand for efficient solution algorithms. In this paper, we propose novel quasi-Newton methods for…