Veronika Pillwein

Orcid: 0000-0003-0408-796X

According to our database1, Veronika Pillwein authored at least 31 papers between 2006 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
An extension of holonomic sequences: <i>C</i><sup>2</sup>-finite sequences.
J. Symb. Comput., 2023

Order bounds for C<sup>2</sup>-finite sequences.
CoRR, 2023

Order bounds for C2-finite sequences.
Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation, 2023

2022
Recurrences for Quadrilateral High-Order Finite Elements.
Math. Comput. Sci., 2022

Difference equation satisfied by the Stieltjes transform of a sequence.
Maple Trans., 2022

Simple C2-finite Sequences: a Computable Generalization of C-finite Sequences.
Proceedings of the ISSAC '22: International Symposium on Symbolic and Algebraic Computation, Villeneuve-d'Ascq, France, July 4, 2022

A Comparison of Algorithms for Proving Positivity of Linearly Recurrent Sequences.
Proceedings of the Computer Algebra in Scientific Computing - 24th International Workshop, 2022

2021
Recursion formulas for integrated products of Jacobi polynomials.
CoRR, 2021

On C<sup>2</sup>-finite Sequences.
Proceedings of the ISSAC '21: International Symposium on Symbolic and Algebraic Computation, 2021

2020
Some structural results on D<sup><i>n</i></sup>-finite functions.
Adv. Appl. Math., 2020

2019
A computable extension for D-finite functions: DD-finite functions.
J. Symb. Comput., 2019

On the positivity of the Gillis-Reznick-Zeilberger rational function.
Adv. Appl. Math., 2019

2018
Algorithmic Arithmetics with DD-Finite Functions.
Proceedings of the 2018 ACM on International Symposium on Symbolic and Algebraic Computation, 2018

2015
An efficient procedure deciding positivity for a class of holonomic functions.
ACM Commun. Comput. Algebra, 2015

An Introduction to Finite Element Methods.
Proceedings of the 2015 ACM on International Symposium on Symbolic and Algebraic Computation, 2015

Symbolic Computation and Finite Element Methods - (Invited Talk).
Proceedings of the Computer Algebra in Scientific Computing - 17th International Workshop, 2015

2014
A note on uniform approximation of functions having a double pole.
LMS J. Comput. Math., 2014

A local Fourier convergence analysis of a multigrid method using symbolic computation.
J. Symb. Comput., 2014

2013
Fast Summation Techniques for Sparse Shape Functions in Tetrahedral hp-FEM.
Proceedings of the Domain Decomposition Methods in Science and Engineering XX, 2013

Sparsity optimized high order finite element functions for H(curl) on tetrahedra.
Adv. Appl. Math., 2013

Termination conditions for positivity proving procedures.
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2013

2012
Sparsity optimized high order finite element functions for H(div) on simplices.
Numerische Mathematik, 2012

Closed form solutions of linear difference equations in terms of symmetric products.
ACM Commun. Comput. Algebra, 2012

2011
On the average complexity for the verification of compatible sequences.
Inf. Process. Lett., 2011

Dominance in the family of Sugeno-Weber t-norms.
Fuzzy Sets Syst., 2011

2010
When can we decide that a P-finite sequence is positive?
CoRR, 2010

Automatic Improvements of Wallis' Inequality.
Proceedings of the 12th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2010

When can we detect that a P-finite sequence is positive?
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2010

2008
Positivity of certain sums over Jacobi kernel polynomials.
Adv. Appl. Math., 2008

2007
Sparse shape functions for tetrahedral <i>p</i> -FEM using integrated Jacobi polynomials.
Computing, 2007

2006
Hypergeometric Summation Algorithms for High-order Finite Elements.
Computing, 2006


  Loading...