Results 111 to 120 of about 18,698 (161)
Total Knee Arthroplasty in the Presence of Congenital Heart Disease: An Under-Recognized Risk. [PDF]
Kazemi SM +8 more
europepmc +1 more source
Biomechanics of static roll posture control by body flexion in adult zebrafish. [PDF]
Nagaoka R +3 more
europepmc +1 more source
Evaluation of Factors Affecting Changes in Endotracheal Cuff Pressures During Laparoscopic Bariatric Surgery. [PDF]
Tosun Söner H +9 more
europepmc +1 more source
Retrieval of an Undeflatable Balloon During Percutaneous Coronary Intervention in Combination With Small Thoracotomy. [PDF]
Okabe K +4 more
europepmc +1 more source
Isosingular Sets and Deflation [PDF]
Deflation is an important method of regularizing nonreduced solution sets of systems of polynomials over the complex numbers so that, for example, Newton's method can be applied to approximate solutions to arbitrary accuracy. The current article defines three new, equivalent methods of deflation, each having specific strengths and weaknesses.
Jonathan D Hauenstein +2 more
exaly +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
2008
In this paper we consider deflations (inverse pocket flips) of n -gons for small n . We show that every pentagon can be deflated after finitely many deflations, and that any infinite deflation sequence of a pentagon results from deflating an induced quadrilateral on four of the vertices.
Demaine, Erik D. +7 more
openaire +2 more sources
In this paper we consider deflations (inverse pocket flips) of n -gons for small n . We show that every pentagon can be deflated after finitely many deflations, and that any infinite deflation sequence of a pentagon results from deflating an induced quadrilateral on four of the vertices.
Demaine, Erik D. +7 more
openaire +2 more sources
GMRES with Deflated Restarting
SIAM Journal on Scientific Computing, 2002A new version of the generalized minimal residuum (GMRES) algorithm for solving large systems of linear equations is described. It uses a ``deflated restarting'' and at each cycle a recurrence similar to the Arnoldi's one is generated. The new algorithm has about the same storage and expense requirements as GMRES with implicitly restarted Arnoldi ...
openaire +2 more sources
Journal of the Society for Industrial and Applied Mathematics, 1961
The reduction of a matrix which has several roots is treated. For example, when a characteristic root of a matrix A of order n is known, it is possible, by any of sev eral known methods, to replace A by a matrix B, n-1 of whose roots are the yet unknown roots of A, and such that either B is of order n-1, or else its remaining root is zero.
openaire +2 more sources
The reduction of a matrix which has several roots is treated. For example, when a characteristic root of a matrix A of order n is known, it is possible, by any of sev eral known methods, to replace A by a matrix B, n-1 of whose roots are the yet unknown roots of A, and such that either B is of order n-1, or else its remaining root is zero.
openaire +2 more sources

