Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision Next revision | Previous revision | ||
|
calg:dubna07:abstracts [03/062007 18:08] kryukov |
calg:dubna07:abstracts [03/062007 18:10] (current) kryukov |
||
|---|---|---|---|
| Line 46: | Line 46: | ||
| ==== About one approach for constructing parallel computer algebra ==== | ==== About one approach for constructing parallel computer algebra ==== | ||
| - | ** G.I.Malaschonok, Yu.D.Valeev</strong> (Tambov State University)** | + | ** G.I.Malaschonok, Yu.D.Valeev (Tambov State University)** |
| - | We discuss one approach for constructing a parallel computer algebra. The base of this approach is a "temporal" tree algorithm, which is represented by the weighted tree. Data is passed through the edges of a graph, computational procedures are allocated in the vertexes of the graph and the weights of the edges denote the order of the priority of data which passes through these edges.</p> | + | We discuss one approach for constructing a parallel computer algebra. The base of this approach is a "temporal" tree algorithm, which is represented by the weighted tree. Data is passed through the edges of a graph, computational procedures are allocated in the vertexes of the graph and the weights of the edges denote the order of the priority of data which passes through these edges. |
| ==== Two algorithms for matrix inversion ==== | ==== Two algorithms for matrix inversion ==== | ||
| Line 80: | Line 80: | ||
| ==== The Homogeneous Groebner Basis for the SU(3)-gauge Mechanics ==== | ==== The Homogeneous Groebner Basis for the SU(3)-gauge Mechanics ==== | ||
| - | **V.Gerdt, A. Khvedelidze, Yu.Palii </strong>(JINR, Dubna)** | + | **V.Gerdt, A. Khvedelidze, Yu.Palii (JINR, Dubna)** |
| The Groebner bases techniques is applied to the analysis of the so-called Yang-Mills mechanics, which is the degenerate | The Groebner bases techniques is applied to the analysis of the so-called Yang-Mills mechanics, which is the degenerate | ||
| Line 115: | Line 115: | ||
| **Skorokhodov S.L. (Computing Centre of RAS)** | **Skorokhodov S.L. (Computing Centre of RAS)** | ||
| - | We study the Orr-Sommerfeld equation for the Couette flow in a channel. A new efficient method for computation eigenvalues $\lambda_n$ was elaborated for the large Reynolds numbers R >> 1. Using the system Maple and numerical evaluations we find, that the eigenvalues $\lambda_n$ have denumerable number of branch points $R_k > 1$ at which the eigenvalues $\lambda_n$ with two different numbers $n_1$ and $n_2$ form the double eigenvalues. | + | We study the Orr-Sommerfeld equation for the Couette flow in a channel. A new efficient method for computation eigenvalues $\lambda_n$ was elaborated for the large Reynolds numbers R >> 1. Using the system Maple and numerical evaluations we find, that the eigenvalues $\lambda_n$ have denumerable number of branch points $R_k > 1$ at which the eigenvalues $\lambda_n$ with two different numbers $n_1$ and $n_2$ form the double eigenvalues. |
| ==== Branching of the eigenvalues for the Coulomb spheroidal wave equation ==== | ==== Branching of the eigenvalues for the Coulomb spheroidal wave equation ==== | ||
