Skip to main content Accessibility help
×
Home

A simple proof of the exponential convergence of the modified Jacobi–Perron algorithm

Published online by Cambridge University Press:  02 April 2001

RONALD MEESTER
Affiliation:
University of Utrecht, Department of Mathematics, PO Box 80.010, 3508 TA Utrecht, The Netherlands (e-mail: meester@math.uu.nl)

Abstract

The modified Jacobi–Perron algorithm was shown by Ito etal in 1993 to be strongly convergent (in the sense of Brentjes 1981) almost everywhere with exponential rate. Their proof relies on very complicated computations. We will show that the original article by Podsypanin in 1977 on the modified Jacobi–Perron algorithm almost contains a proof of this convergence with exponential rate. The only ingredients missing in that article are some ergodic-theoretical facts about the transformation generating the approximations. This leads to a very simple proof of the before mentioned exponential convergence in the modified Jacobi–Perron algorithm.

Type
Research Article
Copyright
1999 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below.

Full text views

Full text views reflects PDF downloads, PDFs sent to Google Drive, Dropbox and Kindle and HTML full text views.

Total number of HTML views: 0
Total number of PDF views: 20 *
View data table for this chart

* Views captured on Cambridge Core between September 2016 - 20th January 2021. This data will be updated every 24 hours.

Hostname: page-component-76cb886bbf-cdxmh Total loading time: 0.234 Render date: 2021-01-20T11:10:23.015Z Query parameters: { "hasAccess": "0", "openAccess": "0", "isLogged": "0", "lang": "en" } Feature Flags: { "shouldUseShareProductTool": true, "shouldUseHypothesis": true, "isUnsiloEnabled": true, "metrics": true, "metricsAbstractViews": false, "peerReview": true, "crossMark": true, "comments": true, "relatedCommentaries": true, "subject": true, "clr": true, "languageSwitch": true, "figures": false, "newCiteModal": false }

Send article to Kindle

To send this article to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle. Find out more about sending to your Kindle.

Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

A simple proof of the exponential convergence of the modified Jacobi–Perron algorithm
Available formats
×

Send article to Dropbox

To send this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Dropbox.

A simple proof of the exponential convergence of the modified Jacobi–Perron algorithm
Available formats
×

Send article to Google Drive

To send this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Google Drive.

A simple proof of the exponential convergence of the modified Jacobi–Perron algorithm
Available formats
×
×

Reply to: Submit a response


Your details


Conflicting interests

Do you have any conflicting interests? *