Result 1 to 20 of 270 total
Solving linear systems of equations with randomization, augmentation and aggregation. (English)
Linear Algebra Appl. 437, No. 12, 2851-2876 (2012).
1
Root-refining for a polynomial equation. (English)
Gerdt, Vladimir P. (ed.) et al., Computer algebra in scientific computing. 14th international workshop, CASC 2012, Maribor, Slovenia, September 3‒6, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-32972-2/pbk). Lecture Notes in Computer Science 7442, 283-293 (2012).
2
Real and complex polynomial root-finding by means of eigen-solving. (English)
Gerdt, Vladimir P. (ed.) et al., Computer algebra in scientific computing. 14th international workshop, CASC 2012, Maribor, Slovenia, September 3‒6, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-32972-2/pbk). Lecture Notes in Computer Science 7442, 271-282 (2012).
3
A note on the paper “Multiplication of polynomials modulo $x^n$” by Murat Cenk and Ferruh Özbudak. (A note on the paper by Murat Cenk and Ferruh Ozbudak “Multiplication of polynomials modulo $x^n$”, Theoret. Comput. Sci. 412 (2011) 3451‒3462.) (English)
Theor. Comput. Sci. 428, 91 (2012).
4
Nearly optimal solution of rational linear systems of equations with symbolic lifting and numerical initialization. (English)
Comput. Math. Appl. 62, No. 4, 1685-1706 (2011).
5
Matrix computations and polynomial root-finding with preprocessing. (English)
Linear Algebra Appl. 434, No. 4, 854-879 (2011).
6
Root-finding by expansion with independent constraints (English)
Computers & Mathematics with Applications 62, No. 8, 3164-3182 (2011).
7
Nearly optimal solution of rational linear systems of equations with symbolic lifting and numerical initialization (English)
Computers & Mathematics with Applications 62, No. 4, 1685-1706 (2011).
8
New progress in real and complex polynomial root-finding (English)
Computers & Mathematics with Applications 61, No. 5, 1305-1334 (2011).
9
Randomized preconditioning of the MBA algorithm (English)
ISSAC, 281-288 (2011).
10
Newton’s iteration for matrix inversion, advances and extensions. (English)
Olshevsky, Vadim (ed.) et al., Matrix methods. Theory, algorithms and applications. Dedicated to the memory of Gene Golub. Based on the 2nd international conference on matrix methods and operator equations, Moscow, Russia, July 23‒27, 2007. Hackensack, NJ: World Scientific (ISBN 978-981-283-601-4/hbk). 364-381 (2010).
11
Unified nearly optimal algorithms for structured integer matrices. (English)
Bini, Dario Andrea (ed.) et al., Numerical methods for structured matrices and applications. The Georg Heinig memorial volume. Basel: Birkhäuser (ISBN 978-3-7643-8995-6/hbk). Operator Theory: Advances and Applications 199, 359-375 (2010).
12
Advancing matrix computations with randomized preprocessing. (English)
Ablayev, Farid (ed.) et al., Computer science ‒ theory and applications. 5th international computer science symposium in Russia, CSR 2010, Kazan, Russia, June 16‒20, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-13181-3). Lecture Notes in Computer Science 6072, 303-314 (2010).
13
Randomized preprocessing of homogeneous linear systems of equations. (English)
Linear Algebra Appl. 432, No. 12, 3272-3318 (2010).
14
Additive preconditioning for matrix computations. (English)
Linear Algebra Appl. 432, No. 4, 1070-1089 (2010).
15
Advancing matrix computations with randomized preprocessing (English)
CSR, 303-314 (2010).
16
Real and complex polynomial root-finding with eigen-solving and preprocessing (English)
ISSAC, 219-226 (2010).
17
A new error-free floating-point summation algorithm. (English)
Comput. Math. Appl. 57, No. 4, 560-564 (2009).
18
Additive preconditioning, eigenspaces, and the inverse iteration. (English)
Linear Algebra Appl. 430, No. 1, 186-203 (2009).
19
A new error-free floating-point summation algorithm (English)
Computers & Mathematics with Applications 57, No. 4, 560-564 (2009).
20
Result 1 to 20 of 270 total
Start
Contact
Print
General Help
