Related papers: A Fast Algorithm for Solving Henderson's Mixed Mod…
In this work we introduce and analyze a novel Hybrid High-Order method for the steady incompressible Navier-Stokes equations. The proposed method is inf-sup stable on general polyhedral meshes, supports arbitrary approximation orders, and…
We consider solving the surface Helmholtz equation on a smooth two dimensional surface embedded into a three dimensional space meshed with tetrahedra. The mesh does not respect the surface and thus the surface cuts through the elements. We…
We present a hierarchical approach for enhancing the robustness of numerical solvers for modelling radiative MHD flows in multi-dimensions. This approach is based on clustering the entries of the global Jacobian in a hierarchical manner…
A homotopy method for multi-objective optimization that produces uniformly sampled Pareto fronts by construction is presented. While the algorithm is general, of particular interest is application to simulation-based engineering…
We present and analyze a new embedded--hybridized discontinuous Galerkin finite element method for the Stokes problem. The method has the attractive properties of full hybridized methods, namely an $H({\rm div})$-conforming velocity field,…
We consider a many-to-one variant of the stable matching problem. More concretely, we consider the variant of the stable matching problem where one side has a matroid constraint. Furthermore, we consider the situation where the preference…
We solve tensor balancing, rescaling an Nth order nonnegative tensor by multiplying N tensors of order N - 1 so that every fiber sums to one. This generalizes a fundamental process of matrix balancing used to compare matrices in a wide…
This work is to propose an iterative method of choice to compute a stable subspace of a regular matrix pencil. This approach is to define a sequence of matrix pencils via particular left null spaces. We show that this iteration preserves a…
We use the standard multiple shooting method to solve a linear two point boundary-value problem. To ensure that the solution obtained by combining the partial solutions is continuous and satisfies the boundary conditions, we have to solve a…
This paper presents a fast algorithm to solve a spectral estimation problem for two-dimensional random fields. The latter is formulated as a convex optimization problem with the Itakura-Saito pseudodistance as the objective function subject…
In this paper, a practicable simulation-free model order reduction method by nonlinear moment matching is developed. Based on the steady-state interpretation of linear moment matching, we comprehensively explain the extension of this…
In this paper we consider ill-posed inverse problems, both linear and nonlinear, by a heavy ball method in which a strongly convex regularization function is incorporated to detect the feature of the sought solution. We develop ideas on how…
A linear inverse problem is proposed that requires the determination of multiple unknown signal vectors. Each unknown vector passes through a different system matrix and the results are added to yield a single observation vector. Given the…
We propose a relax-and-round approach combined with a greedy search strategy for performing complex lattice basis reduction. Taking an optimization perspective, we introduce a relaxed version of the problem that, while still nonconvex, has…
We present a new solution for fundamental problems in nonlinear dynamical systems: finding, verifying, and stabilizing cycles. The solution we propose consists of a new control method based on mixing previous states of the system (or the…
We present a novel, global algorithm for solving polynomial multiparameter eigenvalue problems (PMEPs) by leveraging a hidden variable tensor Dixon resultant framework. Our method transforms a PMEP into one or more univariate polynomial…
We introduce and compare new compression approaches to obtain regularized solutions of large linear systems which are commonly encountered in large scale inverse problems. We first describe how to approximate matrix vector operations with a…
A new method of numerical solution for partial differential equations is proposed. The method is based on a fast matrix multiplication algorithm. Two-dimensional Poison equation is used for comparison of the proposed method with…
We present an enhanced version of the row-based randomized block-Kaczmarz method to solve a linear system of equations. This improvement makes use of a regularization during block updates in the solution, and a dynamic proposal distribution…
An efficient method for solving large nonlinear problems combines Newton solvers and Domain Decomposition Methods (DDM). In the DDM framework, the boundary conditions can be chosen to be primal, dual or mixed. The mixed approach presents…