Scholars Central

Conference abstractPublished 27 Jun 2016

Spectral computational methods

Authors: George Rawitscher

University of Connecticut, USA

Ask about this article

Abstract

Select any words in the title or abstract, or press this and choose a sentence.

The spectral computational methods for solving a differential or integral equation are much more efficient, both in the execution time and in the accuracy, than the conventional finite difference algorithms. The main reason is that the spectral methods use information simultaneously from all the mesh points, while the finite difference methods, such as Runge-Kutta or Numerov (based on Taylor’s series), can use simultaneously only a restricted number mesh points. Spectral methods, which came into vogue since the 1970âÂ?Â?s, use expansions into a set of pre determined basis functions, such as Legendre, Lagrange, or Chebyshev polynomials, whose mesh points are carefully chosen according to well established mathematical theorems. Numerical examples for application to physics will be presented, illustrating the advantages and some draw-backs of the spectral methods. They are not difficult to learn or implement.

Subjects

Chemistry

Ask about this article

Answers come only from this article's title, abstract and keywords, each sentence pointing to where it comes from. Your question is sent to OpenAI to write the answer. Scholars Central does not store it.

Try:

Similar by topic

More from this journal

The newest in Journal of Physical Chemistry & Biophysics.

All its articles

Conferences in this field

Upcoming conferences in this field.

Follow

New articles from what you follow go into your email digest, once you agree to alert emails.

  • JournalJournal of Physical Chemistry & Biophysics
  • SubjectChemistry
  • BylineArticles whose byline prints “George Rawitscher”

For authors and organisers

Publish, present and keep up with your field

Find the right journal for your paper and submit your manuscript.

Photo: Pexels