Mathematics in Computer Science
Công bố khoa học tiêu biểu
* Dữ liệu chỉ mang tính chất tham khảo
Sắp xếp:
Symbolic Computation for Rankin-Cohen Differential Algebras: A Case Study
Mathematics in Computer Science - Tập 11 - Trang 401-415 - 2017
Don Zagier defined a “Rankin-Cohen algebra”, motivated by the study of differential operators that send modular forms to modular forms. We devised an algorithm that computes the result of the differentiation given by the modular forms that correspond to higher-order Wronskians over Klein’s quartic curve, which are modular forms of arbitrarily high degree canonically attached to the curve; this too......
Block Graphs in Practice
Mathematics in Computer Science - Tập 11 Số 2 - Trang 191-196 - 2017
Motivated by the rapidly increasing size of genomic databases, code repositories and versioned texts, several compression schemes have been proposed that work well on highly-repetitive strings and also support fast random access: e.g., LZ-End, RLZ, GDC, augmented SLPs, and block graphs. Block graphs have good worst-case bounds but it has been an open question whether they are practical. We describ......
A New Method for Real Root Isolation of Univariate Polynomials
Mathematics in Computer Science - Tập 1 - Trang 305-320 - 2007
A new algorithm for real root isolation of univariate polynomials is proposed, which is mainly based on exact interval arithmetic and bisection method. Although exact interval arithmetic is usually supposed to be inefficient, our algorithm is surprisingly fast because the termination condition of our algorithm is different from those of existing algorithms which are mostly based on Descartes’ rule......
Supra-Hereditary Properties of Hypergraphs
Mathematics in Computer Science - Tập 5 Số 1 - Trang 3-6 - 2011
Optimal Eighth Order Iterative Methods
Mathematics in Computer Science - Tập 5 - Trang 237-243 - 2011
We develop an eighth order family of methods, consisting of three steps and three parameters, for solving nonlinear equations. Per iteration the methods require four evaluations (three function evaluations and one evaluation of the first derivative). Convergence analysis shows that the family is eighth-order convergent which is also substantiated through the numerical work. Computational results a......
Grammatical Verification for Mathematical Formula Recognition Based on Context-Free Tree Grammar
Mathematics in Computer Science - - 2010
Improved Self-Stabilizing Algorithms for L(2, 1)-Labeling Tree Networks
Mathematics in Computer Science - - 2011
Foreword to the Special Focus on Advances in Symbolic and Numeric Computation IV
Mathematics in Computer Science - Tập 16 Số 1 - 2022
Modeling of an Asymptotically Central Markov Process on 3D Young Graph
Mathematics in Computer Science - Tập 11 - Trang 315-328 - 2017
The paper discusses the asymptotics of path probabilities in Markov processes close to a central one on 3D Young graph. We consider a one-parameter family of such processes and compute the parameter value in such a way that the centrality condition is satisfied with the greatest possible accuracy. We defined a normalized dimension of paths in the 3D Young graph. We study the growth and oscillation......
Subdivision Strategies for Boxes in Branch-and-Bound Nonlinear Solvers and Verification
Mathematics in Computer Science - Tập 8 - Trang 341-355 - 2014
Most verified solvers for nonlinear interval systems of equations comprise two strategies: a branch-and-bound-type “location” phase for excluding regions that cannot contain a solution, and a “verification” phase for proving that the remaining regions do indeed contain solutions. In the first phase, subdivision is crucial for the efficiency of the solvers. We discuss several ways for subdivision a......
Tổng số: 433
- 1
- 2
- 3
- 4
- 5
- 6
- 10