Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userNearest $Omega$-stable matrix via Riemannian optimization
296
0
0.0
(
0
)
Added by
Federico G. Poloni
Publication date
2020
fields
Informatics Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
We study the problem of finding the nearest $Omega$-stable matrix to a certain matrix $A$, i.e., the nearest matrix with all its eigenvalues in a prescribed closed set $Omega$. Distances are measured in the Frobenius norm. An important special case is finding the nearest Hurwitz or Schur stable matrix, which has applications in systems theory. We describe a reformulation of the task as an optimization problem on the Riemannian manifold of orthogonal (or unitary) matrices. The problem can then be solved using standard methods from the theory of Riemannian optimization. The resulting algorithm is remarkably fast on small-scale and medium-scale matrices, and returns directly a Schur factorization of the minimizer, sidestepping the numerical difficulties associated with eigenvalues with high multiplicity.
rate research
Read More
We propose a new Riemannian geometry for fixed-rank matrices that is specifically tailored to the low-rank matrix completion problem. Exploiting the degree of freedom of a quotient space, we tune the metric on our search space to the particular least square cost function. At one level, it illustrates in a novel way how to exploit the versatile framework of optimization on quotient manifold. At another level, our algorithm can be considered as an improved version of LMaFit, the state-of-the-art Gauss-Seidel algorithm. We develop necessary tools needed to perform both first-order and second-order optimization. In particular, we propose gradient descent schemes (steepest descent and conjugate gradient) and trust-region algorithms. We also show that, thanks to the simplicity of the cost function, it is numerically cheap to perform an exact linesearch given a search direction, which makes our algorithms competitive with the state-of-the-art on standard low-rank matrix completion instances.
In many applications, it is impractical -- if not even impossible -- to obtain data to fit a known cubature formula (CF). Instead, experimental data is often acquired at equidistant or even scattered locations. In this work, stable (in the sense of nonnegative only cubature weights) high-order CFs are developed for this purpose. These are based on the approach to allow the number of data points N to be larger than the number of basis functions K which are integrated exactly by the CF. This yields an (N-K)-dimensional affine linear subspace from which cubature weights are selected that minimize certain norms corresponding to stability of the CF. In the process, two novel classes of stable high-order CFs are proposed and carefully investigated.
In this paper, we give a new characterization of the cut locus of a point on a compact Riemannian manifold as the zero set of the optimal transport density solution of the Monge-Kantorovich equations, a PDE formulation of the optimal transport problem with cost equal to the geodesic distance. Combining this result with an optimal transport numerical solver based on the so-called dynamical Monge-Kantorovich approach, we propose a novel framework for the numerical approximation of the cut locus of a point in a manifold. We show the applicability of the proposed method on a few examples settled on 2d-surfaces embedded in $R^{3}$ and discuss advantages and limitations.
Many problems in engineering can be understood as controlling the bifurcation structure of a given device. For example, one may wish to delay the onset of instability, or bring forward a bifurcation to enable rapid switching between states. We propose a numerical technique for controlling the bifurcation diagram of a nonlinear partial differential equation by varying the shape of the domain. Specifically, we are able to delay or advance a given bifurcation point to a given parameter value, often to within machine precision. The algorithm consists of solving a shape optimization problem constrained by an augmented system of equations, the Moore--Spence system, that characterize the location of the bifurcation points. Numerical experiments on the Allen--Cahn, Navier--Stokes, and hyperelasticity equations demonstrate the effectiveness of this technique in a wide range of settings.
This paper focuses on mixing strategies to enhance the growth rate in an algal raceway system. A mixing device, such as a paddle wheel, is considered to control the rearrangement of the depth of the algae cultures hence the light perceived at each lap. The dynamics of the photosystems after a rearrangement is accounted for by the Han model. Our approach consists in considering permanent regimes where the strategy is parametrized by a permutation matrix which modifies the order of the layers at the beginning of each lap. It is proven that the dynamics of the photosystems is then periodic, with a period corresponding to one lap of the raceway whatever the order of the considered permutation matrix is. An objective function related to the average growth rate over one lap is then introduced. Since N ! permutations (N being the number of considered layers) need to be tested in the general case, it can be numerically solved only for a limited number of layers. Consequently, we propose a second optimization problem associated with a suboptimal solution of the initial problem, which can be determined explicitly. A sufficient condition to characterize cases where the two problems have the same solution is given. Some numerical experiments are performed to assess the benefit of optimal strategies in various settings.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
