Applied Numerical Analysis & Computational Mathematics最新文献

筛选
英文 中文
Approximating Solutions of Equations Using Two-Point Newton Methods 用两点牛顿法逼近方程的解
Applied Numerical Analysis & Computational Mathematics Pub Date : 2004-12-22 DOI: 10.1002/anac.200410006
Ioannis K. Argyros
{"title":"Approximating Solutions of Equations Using Two-Point Newton Methods","authors":"Ioannis K. Argyros","doi":"10.1002/anac.200410006","DOIUrl":"10.1002/anac.200410006","url":null,"abstract":"<p>We provide a local as well as a semilocal convergence analysis for two-point Newton methods under very general conditions. Our equation contains a Fréchet differentiable operator <i>F</i> and another operator <i>G</i> whose differentiability is not assumed. Using more precise majorizing sequences than before we provide sufficient convergence conditions for Newton methods to a locally unique solution of equation <i>F</i> (<i>x</i>) + <i>G</i>(<i>x</i>) = 0. In the semilocal case we show under weaker conditions that our error estimates on the distances involved are finer and the information on the location of the solution at least as precise as in earlier results [17]. In the local case a larger radius of convergence is obtained [21]. Several applications are provided to show that our results compare favorably with earlier ones [11]–[14], [17], [21], [23], [25]. (© 2004 WILEY-VCH Verlag GmbH &amp; Co. KGaA, Weinheim)</p>","PeriodicalId":100108,"journal":{"name":"Applied Numerical Analysis & Computational Mathematics","volume":"1 2","pages":"386-412"},"PeriodicalIF":0.0,"publicationDate":"2004-12-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1002/anac.200410006","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73887137","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Signal Estimation from Observations Affected by Random Delays and White plus Coloured Noises 随机延迟和白加彩色噪声影响下的观测信号估计
Applied Numerical Analysis & Computational Mathematics Pub Date : 2004-12-22 DOI: 10.1002/anac.200410012
S. Nakamori, A. Hermoso-Carazo, J. Linares-Pérez, M. I. Sánchez-Rodríguez
{"title":"Signal Estimation from Observations Affected by Random Delays and White plus Coloured Noises","authors":"S. Nakamori,&nbsp;A. Hermoso-Carazo,&nbsp;J. Linares-Pérez,&nbsp;M. I. Sánchez-Rodríguez","doi":"10.1002/anac.200410012","DOIUrl":"10.1002/anac.200410012","url":null,"abstract":"<p>The least-squares linear estimation problem of discrete-time signals using measurements perturbed by additive white plus coloured noises is solved. It is supposed that the measurements are arrived in time or delayed by one sampling time and the delay is modelled by a sequence of independent Bernoulli random variables whose values, one or zero, indicate if there exists or not delay. The estimation algorithms only use the covariance information about the signal and the observation noises and the delay probabilities. (© 2004 WILEY-VCH Verlag GmbH &amp; Co. KGaA, Weinheim)</p>","PeriodicalId":100108,"journal":{"name":"Applied Numerical Analysis & Computational Mathematics","volume":"1 2","pages":"495-506"},"PeriodicalIF":0.0,"publicationDate":"2004-12-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1002/anac.200410012","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88479653","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A Moment-Based Method for Large-Scale Generalized Eigenvalue Problems 基于矩的大规模广义特征值问题求解方法
Applied Numerical Analysis & Computational Mathematics Pub Date : 2004-12-22 DOI: 10.1002/anac.200410014
Tetsuya Sakurai, Hiroto Tadano, Yuichi Inadomi, Umpei Nagashima
{"title":"A Moment-Based Method for Large-Scale Generalized Eigenvalue Problems","authors":"Tetsuya Sakurai,&nbsp;Hiroto Tadano,&nbsp;Yuichi Inadomi,&nbsp;Umpei Nagashima","doi":"10.1002/anac.200410014","DOIUrl":"10.1002/anac.200410014","url":null,"abstract":"<p>In this paper we consider a method for finding several eigenvalues and corresponding eigenvectors of large-scale generalized eigenvalue problems. In this method, a small matrix pencil that has only the desired eigenvalues is derived using complex moments obtained via numerical integration. Since the process to derive the moments can be performed in parallel and we do not need to exchange data between processes, the presented method is suitable for master-worker programming models. We have implemented and tested the proposed method in a grid RPC (remote procedure call) system. Numerical examples illustrate the properties of our approach. (© 2004 WILEY-VCH Verlag GmbH &amp; Co. KGaA, Weinheim)</p>","PeriodicalId":100108,"journal":{"name":"Applied Numerical Analysis & Computational Mathematics","volume":"1 2","pages":"516-523"},"PeriodicalIF":0.0,"publicationDate":"2004-12-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1002/anac.200410014","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75266649","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
A Local Supervised Learning Algorithm For Multi-Layer Perceptrons 多层感知器的局部监督学习算法
Applied Numerical Analysis & Computational Mathematics Pub Date : 2004-12-22 DOI: 10.1002/anac.200410016
D. S. Vlachos
{"title":"A Local Supervised Learning Algorithm For Multi-Layer Perceptrons","authors":"D. S. Vlachos","doi":"10.1002/anac.200410016","DOIUrl":"10.1002/anac.200410016","url":null,"abstract":"<p>The back propagation of error in multi-layer perceptrons when used for supervised training is a non-local algorithm in space, that is it needs the knowledge of the network topology. On the other hand, learning rules in biological systems with many hidden units, seem to be local in both space and time. In this work, a local learning algorithm is proposed which makes no distinction between input, hidden and output layers. Simulation results are presented and compared with other well known training algorithms. (© 2004 WILEY-VCH Verlag GmbH &amp; Co. KGaA, Weinheim)</p>","PeriodicalId":100108,"journal":{"name":"Applied Numerical Analysis & Computational Mathematics","volume":"1 2","pages":"535-539"},"PeriodicalIF":0.0,"publicationDate":"2004-12-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1002/anac.200410016","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73764626","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Optimal Ship Routing Based on Wind and Wave Forecasts 基于风浪预报的船舶最优航路
Applied Numerical Analysis & Computational Mathematics Pub Date : 2004-12-22 DOI: 10.1002/anac.200410018
D. S. Vlachos
{"title":"Optimal Ship Routing Based on Wind and Wave Forecasts","authors":"D. S. Vlachos","doi":"10.1002/anac.200410018","DOIUrl":"10.1002/anac.200410018","url":null,"abstract":"<p>Short term accurate wind and wave forecasts can be used for optimal ship routing. In this work, a method is presented for manipulating the POSEIDON [1] system forecasts for the Greek seas and for producing optimal routes for small and medium size ships. The method is composed from a geometrical calculation of all possible routes between two points and from an iterative algorithm which approximates the optimal (or an almost optimal) route. (© 2004 WILEY-VCH Verlag GmbH &amp; Co. KGaA, Weinheim)</p>","PeriodicalId":100108,"journal":{"name":"Applied Numerical Analysis & Computational Mathematics","volume":"1 2","pages":"547-551"},"PeriodicalIF":0.0,"publicationDate":"2004-12-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1002/anac.200410018","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73790625","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 26
Modified Moments and Orthogonal Rational Functions† 修正矩与正交有理函数
Applied Numerical Analysis & Computational Mathematics Pub Date : 2004-12-22 DOI: 10.1002/anac.200410009
J. Van Deun, A. Bultheel
{"title":"Modified Moments and Orthogonal Rational Functions†","authors":"J. Van Deun,&nbsp;A. Bultheel","doi":"10.1002/anac.200410009","DOIUrl":"10.1002/anac.200410009","url":null,"abstract":"<p>In a series of articles [9, 10, 11] about the numerical computation of orthogonal polynomials on a subset of the real line, Gautschi shows that computing orthogonal polynomials starting from the moments <i>μ<sub>k</sub></i> = ∫ <i>x<sup>k</sup>dμ</i>(<i>x</i>) of the measure is generally an ill-conditioned problem. However, in [10] an alternative approach is presented, based on so-called <i>modified</i> moments, which works better in certain situations. In this paper we generalize these results to the computation of orthogonal rational functions and provide a new modified moment algorithm, based on the connection between modified moments and interpolatory quadrature. (© 2004 WILEY-VCH Verlag GmbH &amp; Co. KGaA, Weinheim)</p>","PeriodicalId":100108,"journal":{"name":"Applied Numerical Analysis & Computational Mathematics","volume":"1 2","pages":"455-468"},"PeriodicalIF":0.0,"publicationDate":"2004-12-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1002/anac.200410009","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78341724","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 6
Incomplete Cholesky Preconditioners with Band-Diagonalization for Sparse Symmetric Systems 稀疏对称系统的带对角化不完全Cholesky预条件
Applied Numerical Analysis & Computational Mathematics Pub Date : 2004-12-22 DOI: 10.1002/anac.200410011
Taku Itoh, Daichi Fujimoto, Takashi Kitagawa, Susumu Nakata
{"title":"Incomplete Cholesky Preconditioners with Band-Diagonalization for Sparse Symmetric Systems","authors":"Taku Itoh,&nbsp;Daichi Fujimoto,&nbsp;Takashi Kitagawa,&nbsp;Susumu Nakata","doi":"10.1002/anac.200410011","DOIUrl":"10.1002/anac.200410011","url":null,"abstract":"<p>In this paper, we present a preconditioning method based on Incomplete Cholesky Decomposition (ICD) combined with a band-diagonalization strategy which enables an efficient ICD. The performance of the ICD preconditioner for sparse symmetric systems has a close relationship to the number of fill-ins of the exact Cholesky decomposition and the number can be decreased by the band-diagonalization. We consider an implicit surface reconstruction as a typical problem which has a property that the coefficient matrix can be transformed into a band-diagonal structure at a low computational cost. The effectiveness of the preconditioning is shown as a result of some numerical experiments. (© 2004 WILEY-VCH Verlag GmbH &amp; Co. KGaA, Weinheim)</p>","PeriodicalId":100108,"journal":{"name":"Applied Numerical Analysis & Computational Mathematics","volume":"1 2","pages":"489-494"},"PeriodicalIF":0.0,"publicationDate":"2004-12-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1002/anac.200410011","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84981258","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
An advanced variant of an interpolatory graphical display algorithm 插值图形显示算法的高级变体
Applied Numerical Analysis & Computational Mathematics Pub Date : 2004-03-15 DOI: 10.1002/anac.200310009
G. Ala, E. Francomano, A. Tortorici, E. Toscano, F. Viola
{"title":"An advanced variant of an interpolatory graphical display algorithm","authors":"G. Ala,&nbsp;E. Francomano,&nbsp;A. Tortorici,&nbsp;E. Toscano,&nbsp;F. Viola","doi":"10.1002/anac.200310009","DOIUrl":"10.1002/anac.200310009","url":null,"abstract":"<p>In this paper an advanced interpolatory graphical display algorithm based on cardinal B-spline functions is provided. It is well-known that B-spline functions are a flexible tool to design various scale rapresentations of a signal. The proposed method allows to display without recursion a function at any desiderable resolution so that only initial data and opportune vectors weight are involved. In this way the structure of the algorithm is independent across the scale and a computational efficiency is reached. In this paper mono and bi-dimensional vectors weight generated by means of centered cubic cardinal B-spline functions have been supplied. (© 2004 WILEY-VCH Verlag GmbH &amp; Co. KGaA, Weinheim)</p>","PeriodicalId":100108,"journal":{"name":"Applied Numerical Analysis & Computational Mathematics","volume":"1 1","pages":"104-112"},"PeriodicalIF":0.0,"publicationDate":"2004-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1002/anac.200310009","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88586063","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Characteristic directions approach to solving scalar one-dimensional nonlinear advection equation with non-convex flow function 非凸流函数标量一维非线性平流方程的特征方向求解方法
Applied Numerical Analysis & Computational Mathematics Pub Date : 2004-03-15 DOI: 10.1002/anac.200310010
D. N. Bokov
{"title":"Characteristic directions approach to solving scalar one-dimensional nonlinear advection equation with non-convex flow function","authors":"D. N. Bokov","doi":"10.1002/anac.200310010","DOIUrl":"10.1002/anac.200310010","url":null,"abstract":"<p>A concept of the characteristic technique used to obtain a generalized solution of the scalar one-dimensional nonlinear advection equation with the non-convex flow function is presented. Two grids: characteristic and Eulerian are used to obtain numerical solution. A characteristic grid is adaptive both to the properties of the initial distribution function and to the properties of the boundary condition function. This allows: development of the algorithm for obtaining a numerical solution on characteristic grid using the properties of the solution of nonlinear advection equation in smooth region; to reproduce spatial location and solution value at the discontinuity points and extreme points at the accuracy determined by interpolation and approximation of initial values and boundary condition functions. For the non-convex flow function, algorithms are proposed for the definition of the sequence of Riemann problems (strong discontinuity) and for their solving. Refined expressions are derived for the velocity of a strong non-stationary discontinuity. Construction of the solution with satisfying of integral preservation law for the non-convex flow function is presented. (© 2004 WILEY-VCH Verlag GmbH &amp; Co. KGaA, Weinheim)</p>","PeriodicalId":100108,"journal":{"name":"Applied Numerical Analysis & Computational Mathematics","volume":"1 1","pages":"113-127"},"PeriodicalIF":0.0,"publicationDate":"2004-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1002/anac.200310010","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77644586","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Spline Based Electronic Modelling 基于样条的电子建模
Applied Numerical Analysis & Computational Mathematics Pub Date : 2004-03-15 DOI: 10.1002/anac.200310027
L. Senthilbalaji Girimurugan
{"title":"Spline Based Electronic Modelling","authors":"L. Senthilbalaji Girimurugan","doi":"10.1002/anac.200310027","DOIUrl":"10.1002/anac.200310027","url":null,"abstract":"<p>“Without Mathematics almost everything is zilch”, a scientific maxim, is the kernel for this mathematical piece of research. The basic notion is to formulate mathematical models for devices and circuits deployed in state of the art electronic gadgets. The article searches for a tool to perform the aforementioned operation and finally accouters its models with well known mathematical approximation tools called Interpolators. The analysis of these models is carried out using MATLAB and the simulations are obtained for both frequency dependent and independent device characteristics. The scheme could result in some predicted merits when it allies with Very Large Scale and Ultra Large Scale Integration [VLSI,ULSI] techniques employed in the Electronic chip design industry and Artificial Intelligence. The quondam alliance could result in device miniaturization and the latter may result in the design of robots enabled in the control of electronic environments. However, the latter could be an application [for Robots] or an alliance where the principles of neural networks could be applied for the purpose of mathematical modelling. Thus, the article reveals a solution for how mathematics be applied to engineering and science. (© 2004 WILEY-VCH Verlag GmbH &amp; Co. KGaA, Weinheim)</p>","PeriodicalId":100108,"journal":{"name":"Applied Numerical Analysis & Computational Mathematics","volume":"1 1","pages":"304-314"},"PeriodicalIF":0.0,"publicationDate":"2004-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1002/anac.200310027","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91289585","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信