Results 211 to 220 of about 25,586 (259)
Some of the next articles are maybe not open access.

Densities of degeneracies and near-degeneracies

Physical Review A, 1993
The eigenvalues of a quantum system depending on two parameters become degenerate at isolated points in the parameter space, which are called diabolical points because of their double-cone structure. Varying one parameter produces near-degeneracies termed avoided crossings. Some results on the density of these objects in parameter space can be obtained
, Wilkinson, , Austin
openaire   +2 more sources

Rank Degeneracy

SIAM Journal on Scientific and Statistical Computing, 1984
The paper surveys some of the more commonly used methods for approximating the rank of a matrix X, with particular attention to the effects of errors. It is supposed that X itself cannot be observed and only a perturbed matrix \(X=X+E\) is given.
openaire   +1 more source

Interdimensional degeneracies, near degeneracies, and their applications

The Journal of Chemical Physics, 1986
Recently developed approximation methods for quantum mechanical problems which treat the spatial dimension D as an expansion parameter offer approximations to energy levels at arbitrary D. Rather than simply being a detour to the D=3 case, there is physical interest in nonphysical values of D due to degeneracies between states in different dimensions ...
D. J. Doren, D. R. Herschbach
openaire   +1 more source

ON DEGENERACY LOCI

International Journal of Mathematics, 1996
Let \(X_r\) be the degeneracy locus of rank \(r\) of a morphism \(\varphi\) of vector bundles over a smooth irreducible variety \(X\), and \({\mathcal I}_{X_r}\) the ideal sheaf of \(X_r\). We quote from the author's introduction: Our aim is to study the cohomology of \({\mathcal I}_{X_r}\). In particular we want to know if \(H^1 ({\mathcal I}_{X_r})=0\
openaire   +2 more sources

DARTS with Degeneracy Correction

2023
The neural architecture search (NAS) is characterized by a wide search space and a time consuming objective function. Many papers have dealt with the reduction of the cost of the objective function assessment. Among them, there is DARTS paper [1] that proposes to transform the original discrete problem into a continuous one.
Lacharme, Guillaume   +3 more
openaire   +2 more sources

Twisted Cubic: Degeneracy Degree and Relationship with General Degeneracy

2010
Fundamental matrix, drawing geometric relationship between two images, plays an important role in 3-dimensional computer vision. Degenerate configurations of space points and two camera optical centers affect stability of computation for fundamental matrix.
Tian Lan, Yihong Wu 0002, Zhanyi Hu
openaire   +1 more source

Degeneracy: Resolve or Avoid?

Journal of the Operational Research Society, 1992
Summary: Two projected gradient algorithms for linear programming are discussed. The first uses a conventional enough steepest edge approach, and implements a version of Wolfe's method for resolving any problems of degeneracy. The second makes use of a steepest descent direction which is calculated by solving a linear least squares problem subject to ...
openaire   +1 more source

A theory of degeneracy graphs

Annals of Operations Research, 1993
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Dealing with degeneracy in triangulation

Computing in Science & Engineering, 2002
Here is a method for dealing with a type of degeneracy that often arises in triangulation then the input contains much regularity, such as four or more points that lie on the same circle in 2D computations or five or more on the same sphere in 3D. The paper shows a dramatic application of Francis Sullivan's and my degeneracy method by Alexander Agathos
openaire   +1 more source

Home - About - Disclaimer - Privacy