Find link

language:

Find link is a tool written by Edward Betts.

searching for Divide-and-conquer algorithm 13 found (68 total)

alternate case: divide-and-conquer algorithm

Arrowhead matrix (1,329 words) [view diff] case mismatch in snippet view article find links to article

S2CID 119640612. Gu, Ming; Eisenstat, Stanley C. (1995). "A Divide-and-Conquer Algorithm for the Symmetric Tridiagonal Eigenproblem". SIAM Journal on

William B. Gragg (322 words) [view diff] no match in snippet view article find links to article

doi:10.1137/0609005. hdl:10945/30445. Article title A Parallel Divide and Conquer Algorithm for the Generalized Real Symmetric Definite Tridiagonal Eigenproblem

Weitao Yang (604 words) [view diff] no match in snippet view article find links to article

cited article in chemistry from 1999 to 2006. Yang developed the Divide and Conquer algorithm for linear-scaling density functional theory. In application

Tridiagonal matrix (2,707 words) [view diff] exact match in snippet view article find links to article

OCLC 228147822. Coakley, E.S.; Rokhlin, V. (2012). "A fast divide-and-conquer algorithm for computing the spectra of real symmetric tridiagonal matrices"

Convex hull algorithms (2,326 words) [view diff] no match in snippet view article find links to article

The first optimal output-sensitive algorithm. It modifies the divide and conquer algorithm by using the technique of marriage-before-conquest and low-dimensional

Capacitated arc routing problem (1,027 words) [view diff] no match in snippet view article find links to article

cooperative co-evolution algorithm. LSCARP can be solved with a divide and conquer algorithm applied to route cutting off decomposition. The LSCARP can also

Lanczos algorithm (8,287 words) [view diff] exact match in snippet view article find links to article

tridiagonal QR is O ( m 2 ) {\displaystyle O(m^{2})} just as for the divide-and-conquer algorithm (though the constant factor may be different); since the eigenvectors

Binary number (7,236 words) [view diff] exact match in snippet view article find links to article

multiplications or divisions where one operand is very large. A simple divide-and-conquer algorithm is more effective asymptotically: given a binary number, it is

Client honeypot (2,601 words) [view diff] exact match in snippet view article find links to article

2007. Seifert, C., Komisarczuk, P. and Welch, I. Application of divide-and-conquer algorithm paradigm to improve the detection speed of high interaction client

Eigenvalue algorithm (4,870 words) [view diff] exact match in snippet view article find links to article

ISBN 978-0-521-43108-8. Coakley, Ed S. (May 2013), "A fast divide-and-conquer algorithm for computing the spectra of real symmetric tridiagonal matrices

Multiplication algorithm (6,871 words) [view diff] no match in snippet view article find links to article

known. Karatsuba multiplication is an O(nlog23) ≈ O(n1.585) divide and conquer algorithm, that uses recursion to merge together sub calculations. By rewriting

Maximum disjoint set (4,745 words) [view diff] exact match in snippet view article find links to article

to find the exact maximum disjoint set in time nO(kc) using a divide-and-conquer algorithm. Start with a quadtree cell that contains all objects. Then recursively

Igor L. Markov (2,996 words) [view diff] exact match in snippet view article find links to article

Petruccione, Francesco; da Silva, Adenilton J. (2021-03-18). "A divide-and-conquer algorithm for quantum state preparation". Scientific Reports. 11 (1): 6329