z-logo
HomeZAIABlog
open-access-imgOpen Access
On computational properties of chains of recurrences
Author(s) -
Eugene V. Zima
Publication year - 2001
Publication title -
citeseer x (the pennsylvania state university)
Language(s) - English
Resource type - Conference proceedings
ISBN - 1-58113-417-7
DOI - 10.1145/384101.384148
Subject(s) - computation , set (abstract data type) , computer science , stability (learning theory) , chain (unit) , algorithm , theoretical computer science , programming language , machine learning , physics , astronomy
Backward and mixed chains of recurrences are introduced. A complete set of chains of recurrences manipulation tools is described. Applications of these tools, related to the safety and numeric stability of chained computations are given.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom

About

AboutCareersPublisher PartnersContact UsGet Organisational Trial or Quote

Learn

FAQsBlogTerms of UsePrivacy Policy

Download the Zendy App

Get it on
Google Play
Download on the
App Store

Discover

Explore

Copyright Knowledge E © 2026. All Rights Reserved.