نتایج جستجو برای: QZ factoriation

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

Journal: :bulletin of the iranian mathematical society 0
effat golpar-raboky university of qom n. mahdavi-amiri sharif university of technology

classes of‎ ‎abaffy-broyden-spedicato (abs) methods have been introduced for‎ ‎solving linear systems of equations‎. ‎the algorithms are powerful methods for developing matrix‎ ‎factorizations and many fundamental numerical linear algebra processes‎. ‎here‎, ‎we show how to apply the abs algorithms to devise algorithms to compute the wz and zw‎ ‎factorizations of a nonsingular matrix as well as...

Journal: :bulletin of the iranian mathematical society 2014
effat golpar-raboky n. mahdavi-amiri

classes of‎ ‎abaffy-broyden-spedicato (abs) methods have been introduced for‎ ‎solving linear systems of equations‎. ‎the algorithms are powerful methods for developing matrix‎ ‎factorizations and many fundamental numerical linear algebra processes‎. ‎here‎, ‎we show how to apply the abs algorithms to devise algorithms to compute the wz and zw‎ ‎factorizations of a nonsingular matrix as well as...

Journal: :Organic & biomolecular chemistry 2016
Poojan Milan Gharat Sindhu Joseph Mahesh Sundararajan Sharmistha Dutta Choudhury Haridas Pal

This study reveals the intriguing modulations in the photophysics of quinizarin (QZ) on its interaction with p-sulfonatocalix[4]arene (SCX4) and p-sulfonatocalix[6]arene (SCX6) hosts. While the SCX6-QZ system shows the usual reduction in both fluorescence intensity and lifetime, the SCX4-QZ system shows a contrasting effect of enhancement in the fluorescence intensity and reduction in the fluor...

2007
Gauri V. Kulkarni Robert C. Nichol Ravi K. Sheth Hee-Jong Seo Daniel J. Eisenstein Alexander Gray

We present measurements of the redshift-space three-point correlation function of 50,967 Luminous Red Galaxies (LRGs) from Data Release 3 (DR3) of the Sloan Digital Sky Survey (SDSS). We have studied the shape dependence of the reduced three-point correlation function (Qz(s, q, θ)) on three different scales, s = 4, 7 and 10 hMpc, and over the range of 1 < q < 3 and 0◦ < θ < 180◦. On small scale...

Journal: :SIAM Journal on Matrix Analysis and Applications 2019

Journal: :J. UCS 2010
Matthias Schröder

We introduce the notion of quasi-zero-dimensionality as a substitute for the notion of zero-dimensionality, motivated by the fact that the latter behaves badly in the realm of qcb-spaces. We prove that the category QZ of quasi-zero-dimensional qcb0-spaces is cartesian closed. Prominent examples of spaces in QZ are the spaces of the Kleene-Kreisel continuous functionals equipped with the respect...

Journal: :CoRR 2015
Gabriel Renault

In normal version of combinatorial game theory, all games are invertible, whereas only the empty game is invertible in misère version. For this reason, several restricted universes were earlier considered for their study, in which more games are invertible. We here study combinatorial games in misère version, in particular universes where no player would like to pass their turn In these univers...

Journal: :SIAM J. Matrix Analysis Applications 2000
David S. Watkins

The implicitly shifted (bulge chasing) QZ algorithm is the most popular method for solving the generalized eigenvalue problem Av = Bv. This paper explains why the QZ algorithm functions well even in the presence of innnite eigenvalues. The key to rapid convergence of QZ (and QR) algorithms is the eeective transmission of shifts during the bulge chase. In this paper the mechanism of transmission...

2010
Monique Jeanblanc Shiqi Song

For a given filtered probability space (Ω,F,P), where F = (Ft)t≥0 is a filtration, an F-adapted continuous increasing process Λ and a positive P-F local martingale N such that Zt := Nte−Λt ≤ 1, t ≥ 0, we construct a model of default time, i.e., a probability measure QZ and a random time τ on an extension of (Ω,F,P), such that Q[τ > t|Ft] = Zt, t ≥ 0. The probability QZ is linked with the well-k...

2006
Björn Adlerborn Daniel Kressner

Recent improvements to the QZ algorithm for solving generalized eigenvalue problems are summarized. Among the major modifications are novel multishift QZ iterations based on chasing chains of tiny bulges and an extension of the so called aggressive early deflation strategy. The former modification aims to improve the execution time of the QZ algorithm on modern computing systems without changin...

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

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