Solving discrete constrained problems on de Rham complex

07/14/2021
by   Zhongjie Lu, et al.
0

The main difficulty in solving the discrete constrained problem is its poor and even ill condition. In this paper, we transform the discrete constrained problems on de Rham complex to Laplace-like problems. This transformation not only make the constrained problems solvable, but also make it easy to use the existing iterative methods and preconditioning techniques to solving large-scale discrete constrained problems.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/11/2017

Porcellio scaber algorithm (PSA) for solving constrained optimization problems

In this paper, we extend a bio-inspired algorithm called the porcellio s...
research
05/05/2021

Auxiliary iterative schemes for the discrete operators on de Rham complex

The main difficulty in solving the discrete source or eigenvalue problem...
research
03/22/2021

Discrete cosine transform LSQR and GMRES methods for multidimensional ill-posed problems

In the present work, we propose new tensor Krylov subspace method for il...
research
08/04/2017

A novel metaheuristic method for solving constrained engineering optimization problems: Drone Squadron Optimization

Several constrained optimization problems have been adequately solved ov...
research
10/20/2022

Double precision is not necessary for LSQR for solving discrete linear ill-posed problems

The growing availability and usage of low precision foating point format...
research
04/08/2021

A new stochastic order based on discrete Laplace transform and some ordering results of the order statistics

This paper aims to study a new stochastic order based upon discrete Lapl...
research
03/25/2017

Solving SDPs for synchronization and MaxCut problems via the Grothendieck inequality

A number of statistical estimation problems can be addressed by semidefi...

Please sign up or login with your details

Forgot password? Click here to reset