Computer Algebra in Scientific Computing: 14th International Workshop, CASC 2012, Maribor, Slovenia, September 3-6, 2012, Proceedings

Overview

This book constitutes the proceedings of the 14th International Workshop on Computer Algebra in Scientific Computing, CASC 2012, held in Maribor, Slovenia, in September 2012. The 28 full papers presented were carefully reviewed and selected for inclusion in this book.

One of the main themes of the CASC workshop series, namely polynomial algebra, is represented by contributions devoted to new algorithms for computing comprehensive Gröbner and ...

See more details below
Paperback (2012)
$68.24
BN.com price
(Save 17%)$83.00 List Price
Other sellers (Paperback)
  • All (8) from $67.01   
  • New (5) from $67.01   
  • Used (3) from $74.16   
Sending request ...

Overview

This book constitutes the proceedings of the 14th International Workshop on Computer Algebra in Scientific Computing, CASC 2012, held in Maribor, Slovenia, in September 2012. The 28 full papers presented were carefully reviewed and selected for inclusion in this book.

One of the main themes of the CASC workshop series, namely polynomial algebra, is represented by contributions devoted to new algorithms for computing comprehensive Gröbner and involutive systems,
parallelization of the Gröbner bases computation, the study of quasi-stable polynomial ideals, new algorithms to compute the Jacobson form of a matrix of Ore polynomials, a recursive Leverrier algorithm for inversion of dense matrices whose entries are monic polynomials, root isolation of zero-dimensional triangular polynomial systems, optimal computation of the third power of a long integer, investigation of the complexity of solving systems with few independent monomials, the study of ill-conditioned polynomial systems, a method for polynomial root-finding via eigen-solving and randomization, an algorithm for fast dense polynomial multiplication with Java using the new opaque typed method, and sparse polynomial powering using heaps.

Read More Show Less

Product Details

Table of Contents

On Polynomial Solutions of Linear Partial Differential and (q-)Difference
Equations.- An Algebraic Characterization of Rainbow Connectivity.- Application of the Method of Asymptotic Solution to One Multi-Parameter Problem.- A New Algorithm for Long Integer Cube Computation with Some
Insight into Higher Powers.- Lightweight Abstraction for Mathematical Computation in Java.- Calculation of Normal Forms of the Euler–Poisson Equations.- Stability of Equilibrium Positions in the Spatial Circular Restricted Four-Body Problem.- Computing Hopf Bifurcations in Chemical Reaction Networks Using Reaction Coordinates.- Comprehensive Involutive Systems.- A Polynomial-Time Algorithm for the Jacobson Form of a Matrix of Ore Polynomials.- The Resonant Center Problem for a 2:-3 Resonant Cubic Lotka–Volterra System.- Complexity of Solving Systems with Few Independent Monomials and Applications to Mass-Action Kinetics Symbolic-Numerical Calculations of.- High-|m| Rydberg States and Decay Rates in Strong Magnetic Fields.- Quasi-stability versus Genericity.- Invariant Theory: Applications and Computations (Invited Talk).- Local Generic Position for Root Isolation of Zero-Dimensional Triangular Polynomial Systems.- On Fulton’s Algorithm for Computing Intersection Multiplicities.- A Note on the Space Complexity of Fast D-Finite Function
Evaluation.- Inversion Modulo Zero-Dimensional Regular Chains.- Sparse Polynomial Powering Using Heaps.- Stability Conditions of Monomial Bases and Comprehensive Gröbner Systems.- Parallel Reduction of Matrices in Gr¨obner Bases Computations.- Real and Complex Polynomial Root-Finding by Means of Eigen-Solving.- Root-Refining for a Polynomial Equation.- PoCaB: A Software Infrastructure to Explore Algebraic Methods for Bio-chemical Reaction Networks.- Approximately Singular Systems and Ill-Conditioned Polynomial Systems.- Symbolic-Numeric Implementation of the Method of Collocations and Least Squares for 3D Navier–Stokes Equations.- Verifiable Conditions on Asymptotic Stabilisability for a Class of Planar Switched Linear Systems.- Improving Angular Speed Uniformity by Optimal C0 Piecewise Reparameterization.- Usage of Modular Techniques for Efficient Computation of Ideal Operations (Invited Talk).

Read More Show Less

Customer Reviews

Be the first to write a review
( 0 )
Rating Distribution

5 Star

(0)

4 Star

(0)

3 Star

(0)

2 Star

(0)

1 Star

(0)

Your Rating:

Your Name: Create a Pen Name or

Barnes & Noble.com Review Rules

Our reader reviews allow you to share your comments on titles you liked, or didn't, with others. By submitting an online review, you are representing to Barnes & Noble.com that all information contained in your review is original and accurate in all respects, and that the submission of such content by you and the posting of such content by Barnes & Noble.com does not and will not violate the rights of any third party. Please follow the rules below to help ensure that your review can be posted.

Reviews by Our Customers Under the Age of 13

We highly value and respect everyone's opinion concerning the titles we offer. However, we cannot allow persons under the age of 13 to have accounts at BN.com or to post customer reviews. Please see our Terms of Use for more details.

What to exclude from your review:

Please do not write about reviews, commentary, or information posted on the product page. If you see any errors in the information on the product page, please send us an email.

Reviews should not contain any of the following:

  • - HTML tags, profanity, obscenities, vulgarities, or comments that defame anyone
  • - Time-sensitive information such as tour dates, signings, lectures, etc.
  • - Single-word reviews. Other people will read your review to discover why you liked or didn't like the title. Be descriptive.
  • - Comments focusing on the author or that may ruin the ending for others
  • - Phone numbers, addresses, URLs
  • - Pricing and availability information or alternative ordering information
  • - Advertisements or commercial solicitation

Reminder:

  • - By submitting a review, you grant to Barnes & Noble.com and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Noble.com Terms of Use.
  • - Barnes & Noble.com reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & Noble.com also reserves the right to remove any review at any time without notice.
  • - See Terms of Use for other conditions and disclaimers.
Search for Products You'd Like to Recommend

Recommend other products that relate to your review. Just search for them below and share!

Create a Pen Name

Your Pen Name is your unique identity on BN.com. It will appear on the reviews you write and other website activities. Your Pen Name cannot be edited, changed or deleted once submitted.

 
Your Pen Name can be any combination of alphanumeric characters (plus - and _), and must be at least two characters long.

Continue Anonymously

    If you find inappropriate content, please report it to Barnes & Noble
    Why is this product inappropriate?
    Comments (optional)