default search action
11th CASC 2009: Kobe, Japan
- Vladimir P. Gerdt, Ernst W. Mayr, Evgenii V. Vorozhtsov:
Computer Algebra in Scientific Computing, 11th International Workshop, CASC 2009, Kobe, Japan, September 13-17, 2009. Proceedings. Lecture Notes in Computer Science 5743, Springer 2009, ISBN 978-3-642-04102-0 - Sergei A. Abramov, Moulay A. Barkatou, Denis E. Khmelnov:
On m-Interlacing Solutions of Linear Difference Equations. 1-17 - Andrey V. Banshchikov:
Parametric Analysis of Stability Conditions for a Satellite with Gyrodines. 18-28 - Rudolf Berghammer, Bernd Braßel:
Computing and Visualizing Closure Objects Using Relation Algebra and RelView. 29-44 - Alexander D. Bruno, Victor F. Edneral:
On Integrability of a Planar ODE System Near a Degenerate Stationary Point. 45-53 - Larisa A. Burlakova:
Conditions of D-Stability of the Fifth-Order Matrices. 54-65 - Ling Ding, Éric Schost:
Code Generation for Polynomial Multiplication. 66-78 - Jean-Charles Faugère:
Solving Structured Polynomial Systems and Applications to Cryptology. 79-80 - Alexander V. Flegontov, M. J. Marusina:
The Comparison Method of Physical Quantity Dimensionalities. 81-88 - Jin-San Cheng, Xiao-Shan Gao, Jia Li:
Ambient Isotopic Meshing for Implicit Algebraic Surfaces with Singularities. 89-93 - Vladimir P. Gerdt, Yuri A. Blinkov:
Involution and Difference Schemes for the Navier-Stokes Equations. 94-105 - Vladimir P. Gerdt, Robert Kragler, Alexander N. Prokopenya:
A Mathematica Package for Simulation of Quantum Computation. 106-117 - Mark Giesbrecht, Myung Sub Kim:
On Computing the Hermite Form of a Matrix of Differential Polynomials. 118-129 - Shutaro Inoue:
On the Computation of Comprehensive Boolean Gröbner Bases. 130-141 - Valentin Irtegov, Tatyana Titorenko:
On Invariant Manifolds of Dynamical Systems in Lie Algebras. 142-154 - Michael Kerber:
On the Complexity of Reliable Root Approximation. 155-167 - Takuya Kitamoto:
Algebraic Approach to the Computation of the Defining Polynomial of the Algebraic Riccati Equation. 168-179 - Vladimir V. Kornyak:
Discrete Dynamics: Gauge Invariance and Quantization. 180-194 - Aless Lasaruk, Thomas Sturm:
Effective Quantifier Elimination for Presburger Arithmetic with Infinity. 195-212 - Natasha Malaschonok:
An Algorithm for Symbolic Solving of Differential Equations and Estimation of Accuracy. 213-225 - Michael B. Monagan, Paul Vrbik:
Lazy and Forgetful Polynomial Arithmetic and Applications. 226-239 - Nikita Gogin, Aleksandr Mylläri:
On the Average Growth Rate of Random Compositions of Fibonacci and Padovan Recurrences. 240-246 - Kosaku Nagasaka:
A Study on Gröbner Basis with Inexact Input. 247-258 - Masayuki Noro:
Modular Algorithms for Computing a Generating Set of the Syzygy Module. 259-268 - Markus Rosenkranz, Georg Regensburger, Loredana Tec, Bruno Buchberger:
A Symbolic Framework for Operations on Linear Boundary Problems. 269-283 - Clarita Saldarriaga Vargas:
Mathematical Model for Dengue Epidemics with Differential Susceptibility and Asymptomatic Patients Using Computer Algebra. 284-298 - Ekaterina Shemyakova:
Multiple Factorizations of Bivariate Linear Partial Differential Operators. 299-309 - Akira Suzuki:
Computing Gröbner Bases within Linear Algebra. 310-321 - Vyacheslav Tsybulin, Andrew D. Nemtsev, Bülent Karasözen:
A Mimetic Finite-Difference Scheme for Convection of Multicomponent Fluid in a Porous Medium. 322-333 - Sergey I. Vinitsky, Ochbadrakh Chuluunbaatar, Vladimir P. Gerdt, A. A. Gusev, V. A. Rostovtsev:
Symbolic-Numerical Algorithms for Solving Parabolic Quantum Well Problem with Hydrogen-Like Impurity. 334-349 - Evgenii V. Vorozhtsov:
New Analytic Solutions of the Problem of Gas Flow in a Casing with Rotating Disc. 350-372 - Maha Youssef, Gerd Baumann:
Hybrid Solution of Two-Point Linear Boundary Value Problems. 373-391
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.