Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Méthode Gram Schmidt")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 73

  • Page / 3
Export

Selection :

  • and

SYNTHESE D'UN FILTRE MULTIDIMENSIONNEL "BLANCHISSANT" D'APRES LA METHODE DE GRAM-SCHMIDTLEKSACHENKO VA; SHATALOV AA.1976; RADIOTEKH. I ELEKTRON.; S.S.S.R.; DA. 1976; VOL. 21; NO 1; PP. 112-119; BIBL. 3 REF.Article

CPU vs. GPU - Performance comparison for the Gram-Schmidt algorithmBRANDES, T; ARNOLD, A; SODDEMANN, T et al.The European physical journal. Special topics. 2012, Vol 210, pp 73-88, issn 1951-6355, 16 p.Article

Numerical Properties of the LLL AlgorithmLUK, Franklin T; SANZHENG QIAO.Proceedings of SPIE, the International Society for Optical Engineering. 2007, pp 669703.1-669703.7, issn 0277-786X, isbn 978-0-8194-6845-1, 1VolConference Paper

CONVERGENCE OF THE CONJUGATE GRAM-SCHMIDT METHODRUSSACK IB.1981; J. OPTIM. THEORY APPL.; ISSN 0022-3239; USA; DA. 1981; VOL. 33; NO 2; PP. 163-173; BIBL. 1 REF.Article

LINEAR LEAST SQUARES BY ELIMINATION AND MGS.PLEMMONS RJ.1974; J. ASS. COMPUTG MACHIN.; U.S.A.; DA. 1974; VOL. 21; NO 4; PP. 581-585; BIBL. 9 REF.Article

CGS ALGORITHMS FOR UNCONSTRAINED MINIMIZATION OF FUNCTIONS.DENNEMEYER RF; MOOKINI EH.1975; J. OPTIMIZ. THEORY APPL.; U.S.A.; DA. 1975; VOL. 16; NO 1-2; PP. 67-85; BIBL. 6 REF.Article

TWO HADAMARD NUMBERS FOR MATRICES.BIRKHOFF G.1975; COMMUNIC. A.C.M.; U.S.A.; DA. 1975; VOL. 18; NO 1; PP. 25-29; BIBL. 13 REF.Article

STEADY STATE WELL FLOW THEORY FOR A CONFINED ELLIPTICAL AQUIFER.1971; WAT. RESOURCES RES.; USA; 1971, VOL. 7, NUM. 0004, P. 942 A 954Miscellaneous

Modified Gram-Schmidt-based antenna selection for MIMO systems in correlated channelsHU, C.-C; YANG, H.-Y.Electronics letters. 2010, Vol 46, Num 1, pp 94-96, issn 0013-5194, 3 p.Article

PLS fits closer than PCRSIJMEN DE JONG.Journal of chemometrics. 1993, Vol 7, Num 6, pp 551-557, issn 0886-9383Article

Orthogonality of Milne's polynomials and raising operatorsGARSIA, A. M.Discrete mathematics. 1992, Vol 99, Num 1-3, pp 247-264, issn 0012-365XArticle

QR decomposition in least squares analysis, with an application to the reduction of rotational spectra to molecular constantsBADOWSKI, N.Spectroscopy letters. 1987, Vol 20, Num 4, pp 365-373, issn 0038-7010Article

Four algorithms for the the efficient computation of truncated pivoted QR approximations to a sparse matrixSTEWART, G. W.Numerische Mathematik. 1999, Vol 83, Num 2, pp 313-323, issn 0029-599XArticle

A comparison of algorithms for forming the QR decomposition for use in regressionSMITH, D. M.Computational statistics & data analysis. 1992, Vol 14, Num 2, pp 229-248, issn 0167-9473Article

Amélioration du problème inverse à deux dimensions pour la résistivité électriqueSASAKI, Y.Butsuri tansa. 1988, Vol 41, Num 2, pp 111-115, issn 0912-7984Article

Rational Krylov : A practical algorithm for large sparse nonsymmetric matrix pencilsRUHE, A.SIAM journal on scientific computing (Print). 1998, Vol 19, Num 5, pp 1535-1551, issn 1064-8275Article

Improved cost functions for economic dispatch computations. Discussion. Authors' replyZI-XIONG LIANG; GLOVER, J. D; VANSLYCK, L. S et al.IEEE transactions on power systems. 1991, Vol 6, Num 2, pp 821-829, issn 0885-8950Conference Paper

Kernel principal component analysis for large scale data setHAIXIAN WANG; ZILAN HU; YU'E ZHAO et al.Lecture notes in computer science. 2006, pp 745-756, issn 0302-9743, isbn 3-540-37271-7, 12 p.Conference Paper

Algorithm 844 : Computing sparse reduced-rank approximations to sparse matricesBERRY, Michael W; PULATOVA, Shakhina A; STEWART, G. W et al.ACM transactions on mathematical software. 2005, Vol 31, Num 2, pp 252-269, issn 0098-3500, 18 p.Article

Frequency-domain equalization for continuous phase modulationJUN TAN; STÜBER, Gordon L.IEEE transactions on wireless communications. 2005, Vol 4, Num 5, pp 2479-2490, issn 1536-1276, 12 p.Article

Comparison of different parallel modified Gram-Schmidt algorithmsRÜNGER, Gudula; SCHWIND, Michael.Lecture notes in computer science. 2005, pp 826-836, issn 0302-9743, isbn 3-540-28700-0, 11 p.Conference Paper

Blind source separation with randomized gram-schmidt orthogonalization for short burst systemsPAPADIAS, Constantinos B; KUZMINSKIY, Alexandr M.ICASSP. 2004, isbn 0-7803-8484-9, vol V, 809-812Conference Paper

Frequency-domain equalization for continuous phase modulationJUN TAN; STÜBER, Gordon L.IEEE International Symposium on Personal, Indoor, and Mobile Radio Communications. 2004, pp 2267-2272, isbn 0-7803-8523-3, 4Vol, 6 p.Conference Paper

Dimension reduction based on orthogonality: A decorrelation method in ICAKUN ZHANG; CHAN, Lai-Wan.Lecture notes in computer science. 2003, pp 132-139, issn 0302-9743, isbn 3-540-40408-2, 8 p.Conference Paper

Jacobi-davidson style QR and QZ algorithms for the reduction of matrix pencilsFOKKEMA, D. R; SLEIJPEN, G. L. G; VAN DER VORST, H. A et al.SIAM journal on scientific computing (Print). 1999, Vol 20, Num 1, pp 94-125, issn 1064-8275Article

  • Page / 3