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
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

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...
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...
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...
04/02/2021

Solving Large Scale Quadratic Constrained Basis Pursuit

Inspired by alternating direction method of multipliers and the idea of ...
06/30/2015

Scalable Discrete Sampling as a Multi-Armed Bandit Problem

Drawing a sample from a discrete distribution is one of the building com...
09/26/2016

Constrained Cohort Intelligence using Static and Dynamic Penalty Function Approach for Mechanical Components Design

Most of the metaheuristics can efficiently solve unconstrained problems;...
12/02/2012

Problem Solving and Computational Thinking in a Learning Environment

Computational thinking is a new problem soling method named for its exte...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.