English
Related papers

Related papers: Solving the 3x3 Real Symmetric Eigenproblem

200 papers

We consider the (precedence constrained) Minimum Feedback Arc Set problem with triangle inequalities on the weights, which finds important applications in problems of ranking with inconsistent information. We present a surprising structural…

Data Structures and Algorithms · Computer Science 2015-03-19 Monaldo Mastrolilli

A numerical algorithm for solving mantle convection problems with strongly variable viscosity is presented. Equations for conservation of mass and momentum for highly viscous and incompressible fluids are solved iteratively by a multigrid…

Geophysics · Physics 2009-11-10 Masanori Kameyama , Akira Kageyama , Tetsuya Sato

We give a simple approximation algorithm for a common generalization of many previously studied extensions of the maximum size stable matching problem with ties. These generalizations include the existence of critical vertices in the graph,…

Data Structures and Algorithms · Computer Science 2024-02-23 Gergely Csáji

We present a multigrid algorithm for self consistent solution of the Kohn-Sham equations in real space. The entire problem is discretized on a real space mesh with a high order finite difference representation. The resulting self consistent…

Materials Science · Physics 2009-10-31 Jian Wang , Thomas L. Beck

We describe an approach to the question of finding real solutions to problems of enumerative geometry, in particular the question of whether a problem of enumerative geometry can have all of its solutions be real. We give some methods to…

alg-geom · Mathematics 2008-02-03 Frank Sottile

We present and analyze a new finite element method for solving interface problems on a triangular grid. The method locally modifies a given triangulation such that the interfaces are accurately resolved and the maximal angle condition…

Numerical Analysis · Mathematics 2026-04-02 Peter Gangl , Ulrich Langer

This paper presents a spectral element finite element scheme that efficiently solves elliptic problems on unstructured hexahedral meshes. The discrete equations are solved using a matrix-free preconditioned conjugate gradient algorithm. An…

Computational Engineering, Finance, and Science · Computer Science 2016-09-21 J. -F. Remacle , R. Gandham , T. Warburton

Finding a maximum-weight matching is a classical and well-studied problem in computer science, solvable in cubic time in general graphs. We consider the specialization called assignment problem where the input is a bipartite graph, and…

Data Structures and Algorithms · Computer Science 2024-10-15 Romaric Duvignau , Noël Gillet , Ralf Klasing

A method is presented for fast diagonalization of a 2x2 or 3x3 real symmetric matrix, that is determination of its eigenvalues and eigenvectors. The Euler angles of the eigenvectors are computed. A small computer algebra program is used to…

Numerical Analysis · Mathematics 2015-02-17 M. J. Kronenburg

We apply verified numerics to the Nirenberg problem, proving that a genuine solution exists near two given computer-generated approximate solutions. This proves existence of a solution for a particular prescribed curvature that was…

Differential Geometry · Mathematics 2026-04-01 Daniel Platt

Normal surface theory is a central tool in algorithmic three-dimensional topology, and the enumeration of vertex normal surfaces is the computational bottleneck in many important algorithms. However, it is not well understood how the number…

Geometric Topology · Mathematics 2010-06-18 Benjamin A. Burton

The graph partition problem is the problem of partitioning the vertex set of a graph into a fixed number of sets of given sizes such that the sum of weights of edges joining different sets is optimized. In this paper we simplify a known…

Optimization and Control · Mathematics 2015-11-25 Edwin R. van Dam , Renata Sotirov

We present a method for the automatic generation of netlists describing general three-dimensional electrothermal and electromagnetic field problems. Using a pair of structured orthogonal grids as spatial discretisation, a one-to-one…

Computational Engineering, Finance, and Science · Computer Science 2019-10-16 Thorben Casper , David Duque , Sebastian Schöps , Herbert De Gersem

We present a framework to solve non-linear eigenvalue problems suitable for a Finite Element discretization. The implementation is based on the open-source finite element software GetDP and the open-source library SLEPc. As template…

Computational Physics · Physics 2020-12-24 Guillaume Demésy , André Nicolet , Boris Gralak , Christophe Geuzaine , Carmen Campos , Jose E. Roman

This paper proposes an explicit computational method for solving a three-dimensional system of nonlinear elastodynamic sine-Gordon equations subject to appropriate initial and boundary conditions. The time derivative is approximated by…

Numerical Analysis · Mathematics 2025-06-19 Eric Ngondiep

In this paper, we propose a decomposition approach for eigenvalue problems with spatial symmetries, including the formulation, discretization as well as implementation. This approach can handle eigenvalue problems with either Abelian or…

Numerical Analysis · Mathematics 2012-11-16 Jun Fang , Xingyu Gao , Aihui Zhou

We present a new approach to three-dimensional electromagnetic scattering problems via fast isogeometric boundary element methods. Starting with an investigation of the theoretical setting around the electric field integral equation within…

Numerical Analysis · Mathematics 2019-06-28 Jürgen Dölz , Stefan Kurz , Sebastian Schöps , Felix Wolf

In this article we propose and numerically implement a mathematical model for the simulation of three-dimensional semiconductor devices characterized by an heterogeneous material structure. The model consists of a system of nonlinearly…

Numerical Analysis · Mathematics 2013-07-12 A. Mauri , R. Sacco , M. Verri

We propose a multigrid correction scheme to solve a new Steklov eigenvalue problem in inverse scattering. With this scheme, solving an eigenvalue problem in a fine finite element space is reduced to solve a series of boundary value problems…

Numerical Analysis · Mathematics 2018-06-18 Yu Zhang , Hai Bi , Yidu Yang

We consider heuristic algorithm for solving graph isomorphism problem. The algorithm based on a successive splitting of the eigenvalues of the matrices which are modifications (to positive defined) of graphs' adjacency matrices.…

General Mathematics · Mathematics 2007-05-23 R. T. Faizullin , A. V. Prolubnikov
‹ Prev 1 3 4 5 6 7 10 Next ›