IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-662-43799-5_19.html
   My bibliography  Save this book chapter

A Symbolic Approach to Compute a Null-Space Basis in the Projection Method

In: Computer Mathematics

Author

Listed:
  • Mark Giesbrecht

    (University of Waterloo, Cheriton School of Computer Science)

  • Nam Pham

    (University of Waterloo, Cheriton School of Computer Science)

Abstract

We present a hybrid symbolic-numeric approach for the so-called projection method for solving the parameterized differential-algebraic constraint equations associated with multibody mechanical systems. A primary problem in this approach is computing a null-space basis of a matrix of multivariate rational functions, the Jacobian of the symbolic constraint matrix. A purely symbolic approach is untenable in terms of the sheer size of the output, whereas a purely numerical approach does not offer the flexibility of leaving some or all parameters unspecified. Instead we propose a hybrid approach, which does a symbolic preconditioning, followed by representing the null-space basis by straight-line C code, i.e., a black-box null-space basis. We do this in a numerically sensitive way, and show that our black box is numerically robust at almost all parameter settings. This is verified by experimental results on inputs from typical multibody models.

Suggested Citation

  • Mark Giesbrecht & Nam Pham, 2014. "A Symbolic Approach to Compute a Null-Space Basis in the Projection Method," Springer Books, in: Ruyong Feng & Wen-shin Lee & Yosuke Sato (ed.), Computer Mathematics, edition 127, pages 243-259, Springer.
    • Handle: RePEc:spr:sprchp:978-3-662-43799-5_19
    DOI: 10.1007/978-3-662-43799-5_19
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sprchp:978-3-662-43799-5_19. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.