发布求助
文献互助 智能选刊 最新文献

Lms Journal of Computation and Mathematics最新文献

筛选
英文 中文
Approximation by a composition of Chlodowsky operators and Százs–Durrmeyer operators on weighted spaces 加权空间上clodowsky算子和Százs-Durrmeyer算子的组合逼近
Lms Journal of Computation and Mathematics Pub Date : 2013-01-01 DOI: 10.1112/S1461157013000090
Aydin Izgi
{"title":"Approximation by a composition of Chlodowsky operators and Százs–Durrmeyer operators on weighted spaces","authors":"Aydin Izgi","doi":"10.1112/S1461157013000090","DOIUrl":"https://doi.org/10.1112/S1461157013000090","url":null,"abstract":"In this paper we deal with the operators $$begin{eqnarray*}{Z}_{n} (f; x)= frac{n}{{b}_{n} } { mathop{sum }nolimits}_{k= 0}^{n} {p}_{n, k} biggl(frac{x}{{b}_{n} } biggr)int nolimits nolimits_{0}^{infty } {s}_{n, k} biggl(frac{t}{{b}_{n} } biggr)f(t)hspace{0.167em} dt, quad 0leq xleq {b}_{n}end{eqnarray*}$$ and study some basic properties of these operators where ${p}_{n, k} (u)=bigl(hspace{-4pt}{scriptsize begin{array}{ l} displaystyle n displaystyle kend{array} } hspace{-4pt}bigr){u}^{k} mathop{(1- u)}nolimits ^{n- k} , (0leq kleq n), uin [0, 1] $ and ${s}_{n, k} (u)= {e}^{- nu} mathop{(nu)}nolimits ^{k} hspace{-3pt}/ k!, uin [0, infty )$ . Also, we establish the order of approximation by using weighted modulus of continuity.","PeriodicalId":54381,"journal":{"name":"Lms Journal of Computation and Mathematics","volume":"16 1","pages":"388-397"},"PeriodicalIF":0.0,"publicationDate":"2013-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1112/S1461157013000090","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"63410796","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}
引用次数: 5
Weak approximation of stochastic differential delay equations for bounded measurable function 有界可测函数随机微分时滞方程的弱逼近
Lms Journal of Computation and Mathematics Pub Date : 2013-01-01 DOI: 10.1112/S1461157013000120
Hua Zhang
{"title":"Weak approximation of stochastic differential delay equations for bounded measurable function","authors":"Hua Zhang","doi":"10.1112/S1461157013000120","DOIUrl":"https://doi.org/10.1112/S1461157013000120","url":null,"abstract":"In this paper we study the weak approximation problem of E [ φ ( x ( T ))] by E [ φ ( y ( T ))], where x ( T ) is the solution of a stochastic differential delay equation and y ( T ) is defined by the Euler scheme. For φ ∈ C 3 b , Buckwar, Kuske, Mohammed and Shardlow (‘Weak convergence of the Euler scheme for stochastic differential delay equations’, LMS J. Comput. Math. 11 (2008) 60–69) have shown that the Euler scheme has weak order of convergence 1. Here we prove that the same results hold when φ is only assumed to be measurable and bounded under an additional non-degeneracy condition.","PeriodicalId":54381,"journal":{"name":"Lms Journal of Computation and Mathematics","volume":"16 1","pages":"319-343"},"PeriodicalIF":0.0,"publicationDate":"2013-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"63410849","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}
引用次数: 3
Computing Hall subgroups of finite groups 计算有限群的霍尔子群
Lms Journal of Computation and Mathematics Pub Date : 2012-12-01 DOI: 10.1112/S1461157012001039
B. Eick, A. Hulpke
{"title":"Computing Hall subgroups of finite groups","authors":"B. Eick, A. Hulpke","doi":"10.1112/S1461157012001039","DOIUrl":"https://doi.org/10.1112/S1461157012001039","url":null,"abstract":"We describe an effective algorithm to compute a set of representatives for the conjugacy classes of Hall subgroups of a finite permutation or matrix group. Our algorithm uses the general approach of the so-called ‘trivial Fitting model’.","PeriodicalId":54381,"journal":{"name":"Lms Journal of Computation and Mathematics","volume":"15 1","pages":"205-218"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1112/S1461157012001039","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"63410369","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}
引用次数: 1
Differential equations and expansions for quaternionic modular forms in the discriminant 6 case 判别情况下四元数模形式的微分方程和展开式
Lms Journal of Computation and Mathematics Pub Date : 2012-12-01 DOI: 10.1112/S146115701200112X
Srinath Baba, H. Granath
{"title":"Differential equations and expansions for quaternionic modular forms in the discriminant 6 case","authors":"Srinath Baba, H. Granath","doi":"10.1112/S146115701200112X","DOIUrl":"https://doi.org/10.1112/S146115701200112X","url":null,"abstract":"We study the differential structure of the ring of modular forms for the unit group of the quaternion algebra over ℚ of discriminant 6. Using these results we give an explicit formula for Taylor expansions of the modular forms at the elliptic points. Using appropriate normalizations we show that the Taylor coefficients at the elliptic points of the generators of the ring of modular forms are all rational and 6-integral. This gives a rational structure on the ring of modular forms. We give a recursive formula for computing the Taylor coefficients of modular forms at elliptic points and, as an application, give an algorithm for computing modular polynomials.","PeriodicalId":54381,"journal":{"name":"Lms Journal of Computation and Mathematics","volume":"15 1","pages":"385-399"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1112/S146115701200112X","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"63410940","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}
引用次数: 8
Products of three pairwise coprime integers in short intervals 短间隔内三个对素数整数的乘积
Lms Journal of Computation and Mathematics Pub Date : 2012-12-01 DOI: 10.1112/S1461157012000058
A. Islam
{"title":"Products of three pairwise coprime integers in short intervals","authors":"A. Islam","doi":"10.1112/S1461157012000058","DOIUrl":"https://doi.org/10.1112/S1461157012000058","url":null,"abstract":"The existence of products of three pairwise coprime integers is investigated in short intervals of the form (x, x + x 1 2 ]. A general theorem is proved which shows that such integer products exist provided there is a bound on the product of any two of them. A particular case of relevance to elliptic curve cryptography, where all three integers are of order x 1 3 , is presented as a corollary to this result.","PeriodicalId":54381,"journal":{"name":"Lms Journal of Computation and Mathematics","volume":"15 1","pages":"59-70"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1112/S1461157012000058","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"63410198","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}
引用次数: 3
Matching simple modules of condensation algebras 缩合代数的简单模匹配
Lms Journal of Computation and Mathematics Pub Date : 2012-12-01 DOI: 10.1112/S1461157012001118
Felix Noeske
{"title":"Matching simple modules of condensation algebras","authors":"Felix Noeske","doi":"10.1112/S1461157012001118","DOIUrl":"https://doi.org/10.1112/S1461157012001118","url":null,"abstract":"We revise the matching algorithm of Noeske ( LMS J. Comput. Math. 11 (2008) 213–222) and introduce a new approach via composition series to expedite the calculations. Furthermore, we show how the matching algorithm may be applied in the more general and frequently occurring setting that we are only given subalgebras of the condensed algebras which each contain the separable algebra of one of their Wedderburn–Malcev decompositions.","PeriodicalId":54381,"journal":{"name":"Lms Journal of Computation and Mathematics","volume":"15 1","pages":"374-384"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"63410924","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}
引用次数: 2
Almost sure asymptotic stability analysis of the θ -Maruyama method applied to a test system with stabilising and destabilising stochastic perturbations 应用于稳定和不稳定随机扰动试验系统的θ -Maruyama方法的几乎肯定渐近稳定性分析
Lms Journal of Computation and Mathematics Pub Date : 2012-12-01 DOI: 10.1112/S1461157012000010
G. Berkolaiko, E. Buckwar, C. Kelly, A. Rodkina
{"title":"Almost sure asymptotic stability analysis of the θ -Maruyama method applied to a test system with stabilising and destabilising stochastic perturbations","authors":"G. Berkolaiko, E. Buckwar, C. Kelly, A. Rodkina","doi":"10.1112/S1461157012000010","DOIUrl":"https://doi.org/10.1112/S1461157012000010","url":null,"abstract":"In the original article [LMS J. Comput. Math. 15 (2012) 71–83], the authors use a discrete form of the Ito formula, developed by Appleby, Berkolaiko and Rodkina [Stochastics 81 (2009) no. 2, 99–127], to show that the almost sure asymptotic stability of a particular two-dimensional test system is preserved when the discretisation step size is small. In this Corrigendum, we identify an implicit assumption in the original proof of the discrete Ito formula that, left unaddressed, would preclude its application to the test system of interest. We resolve this problem by reproving the relevant part of the discrete Ito formula in such a way that confirms its applicability to our test equation. Thus, we reaffirm the main results and conclusions of the original article.","PeriodicalId":54381,"journal":{"name":"Lms Journal of Computation and Mathematics","volume":"15 1","pages":"71-83"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1112/S1461157012000010","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"63410557","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}
引用次数: 19
A linear recurrence sequence of composite numbers 合数的线性递归序列
Lms Journal of Computation and Mathematics Pub Date : 2012-12-01 DOI: 10.1112/S1461157012001143
Jonas Siurys
{"title":"A linear recurrence sequence of composite numbers","authors":"Jonas Siurys","doi":"10.1112/S1461157012001143","DOIUrl":"https://doi.org/10.1112/S1461157012001143","url":null,"abstract":"We prove that for each positive integer k in the range 2≤ k ≤10 and for each positive integer k ≡79 ( mod  120) there is a k -step Fibonacci-like sequence of composite numbers and give some examples of such sequences. This is a natural extension of a result of Graham for the Fibonacci-like sequence.","PeriodicalId":54381,"journal":{"name":"Lms Journal of Computation and Mathematics","volume":"15 1","pages":"360-373"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1112/S1461157012001143","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"63411000","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}
引用次数: 2
On the use of expansion series for stream ciphers 论展开级数在流密码中的应用
Lms Journal of Computation and Mathematics Pub Date : 2012-12-01 DOI: 10.1112/S146115701200109X
C. Diem
{"title":"On the use of expansion series for stream ciphers","authors":"C. Diem","doi":"10.1112/S146115701200109X","DOIUrl":"https://doi.org/10.1112/S146115701200109X","url":null,"abstract":"From power series expansions of functions on curves over finite fields, one can obtain sequences with perfect or almost perfect linear complexity profile. It has been suggested by various authors to use such sequences as key streams for stream ciphers. In this work, we show how long parts of such sequences can be computed efficiently from short ones. Such sequences should therefore considered to be cryptographically weak. Our attack leads in a natural way to a new measure of the complexity of sequences which we call expansion complexity.","PeriodicalId":54381,"journal":{"name":"Lms Journal of Computation and Mathematics","volume":"15 1","pages":"326-340"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1112/S146115701200109X","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"63410865","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}
引用次数: 19
Condensation of homomorphism spaces 同态空间的凝聚
Lms Journal of Computation and Mathematics Pub Date : 2012-12-01 DOI: 10.1112/S1461157012000071
Klaus Lux, Max Neunhöffer, Felix Noeske
{"title":"Condensation of homomorphism spaces","authors":"Klaus Lux, Max Neunhöffer, Felix Noeske","doi":"10.1112/S1461157012000071","DOIUrl":"https://doi.org/10.1112/S1461157012000071","url":null,"abstract":"We present an ecient algorithm for the condensation of homomorphism spaces. This provides an improvement over the known tensor condensation method which is essentially due to a better choice of bases. We explain the theory behind this approach and describe the implementation in detail. Finally, we give timings to compare with previous methods.","PeriodicalId":54381,"journal":{"name":"Lms Journal of Computation and Mathematics","volume":"15 1","pages":"140-157"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1112/S1461157012000071","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"63410252","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
首页 上一页
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学术官方微信