نتایج جستجو برای: complete pivoting

تعداد نتایج: 361447  

Journal: :Linear Algebra and its Applications 2017

Journal: :Linear Algebra and its Applications 1996

Journal: :SIAM Journal on Matrix Analysis and Applications 1999

Journal: :Lecture Notes in Computer Science 2022

Event Detection, which aims to identify and classify mentions of event instances from unstructured articles, is an important task in Natural Language Processing (NLP). Existing techniques for detection only use homogeneous one-hot vectors represent the type classes, ignoring fact that semantic meaning types task. Such approach inefficient prone overfitting. In this paper, we propose Semantic Pi...

Journal: :Journal of Graph Theory 2009
James F. Geelen Sang-il Oum

A circle graph is the intersection graph of a set of chords of a circle. The class of circle graphs is closed under pivotminors. We determine the pivot-minor-minimal non-circle-graphs; there 15 obstructions. These obstructions are found, by computer search, as a corollary to Bouchet’s characterization of circle graphs under local complementation. Our characterization generalizes Kuratowski’s Th...

Journal: :CoRR 2018
Malte Milatz

We show that the pivoting process associated with one line and n points in r-dimensional space may need Ω(log n) steps in expectation as n → ∞. The only cases for which the bound was known previously were for r ≤ 3. Our lower bound is also valid for the expected number of pivoting steps in the following applications: (1) The Random-Edge simplex algorithm on linear programs with n constraints in...

2013

The method used is a direct method based on a sparse variant of Gaussian elimination and is discussed further by Duff and Reid, ACM Trans. Math. Software 9 (1983), 302-325. A detailed discussion on the MA57 strategy and performance is given by Duff, ACM Trans. Math. Software 30 (2004), 118-144. Relevant work on pivoting and scaling strategies is given by Duff and Pralet, SIAM Journal Matrix Ana...

2010
James R. Bunch Linda Kaufman LINDA KAUFMAN

Several decompositions of, symmetric matrices for calculating inertia and solving systems of linear equations are discussed. New partial pivoting strategies for decomposing symmetric matrices are introduced and analyzed.

Journal: :SIAM Journal on Matrix Analysis and Applications 2021

We propose a two-parameter family of nonsymmetric dense $n\times n$ matrices $A(\alpha,\beta)$ for which LU factorization without pivoting is numerically stable, and we show how to choose $\alpha$ $\beta$ achieve any value the $\infty$-norm condition number. The matrix can be formed from simple formula in $O(n^2)$ flops. suitable use HPL-AI Mixed-Precision Benchmark, requires an extreme scale t...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید