default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDShayne Waldron
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j16]Mozhgan Mohammadpour, Shayne Waldron
:
Complex spherical designs from group orbits. J. Approx. Theory 301: 106047 (2024)- [i4]Len Bos, Shayne Waldron:
Equations for the overlaps of a SIC. CoRR abs/2405.14123 (2024) - 2023
- [i3]Len Bos, Sione Ma'u, Shayne Waldron:
On Waldron Interpolation on a Simplex in Rd. CoRR abs/2306.08392 (2023) - 2020
- [i2]Shayne Waldron:
Tight frames over the quaternions and equiangular lines. CoRR abs/2006.06126 (2020) - [i1]Shayne Waldron:
A variational characterisation of projective spherical designs over the quaternions. CoRR abs/2011.08439 (2020)
2010 – 2019
- 2017
- [j15]Shayne Waldron:
A Sharpening of the Welch Bounds and the Existence of Real and Complex Spherical t -Designs. IEEE Trans. Inf. Theory 63(11): 6849-6857 (2017) - 2016
- [j14]Tuan-Yow Chien, Shayne Waldron:
A Characterization of Projective Unitary Equivalence of Finite Frames and Applications. SIAM J. Discret. Math. 30(2): 976-994 (2016) - 2015
- [j13]Tan Duc Do, Shayne Waldron:
Multivariate Bernstein operators and redundant systems. J. Approx. Theory 192: 215-233 (2015)
2000 – 2009
- 2009
- [j12]Shayne Waldron:
Increasing the polynomial reproduction of a quasi-interpolation operator. J. Approx. Theory 161(1): 114-126 (2009) - 2008
- [j11]Shayne Waldron:
Orthogonal polynomials on the disc. J. Approx. Theory 150(2): 117-131 (2008) - [j10]Len Bos, Norman Levenberg, Shayne Waldron:
Pseudometrics, distances and multivariate polynomial inequalities. J. Approx. Theory 153(1): 80-96 (2008) - [j9]Richard Vale, Shayne Waldron:
Tight frames generated by finite nonabelian groups. Numer. Algorithms 48(1-3): 11-27 (2008) - 2007
- [j8]Shayne Waldron:
Hermite polynomials on the plane. Numer. Algorithms 45(1-4): 231-238 (2007) - 2006
- [j7]Shayne Waldron:
On the Bernstein-Bézier form of Jacobi polynomials on a simplex. J. Approx. Theory 140(1): 86-99 (2006) - [j6]Shayne Waldron:
Computing orthogonal polynomials on a triangle by degree raising. Numer. Algorithms 42(2): 171-179 (2006) - 2003
- [j5]Shayne Waldron:
A generalised beta integral and the limit of the Bernstein-Durrmeyer operator with Jacobi weights. J. Approx. Theory 122(1): 141-150 (2003) - [j4]Shayne Waldron:
Generalized Welch bound equality sequences are tight fram. IEEE Trans. Inf. Theory 49(9): 2307-2309 (2003) - 2002
- [j3]Shaun Cooper, Shayne Waldron:
The Diagonalisation of the Multivariate Bernstein Operator. J. Approx. Theory 117(1): 103-131 (2002) - 2000
- [j2]Shayne Waldron:
Minimally supported error representations and approximation by the constants. Numerische Mathematik 85(3): 469-484 (2000)
1990 – 1999
- 1998
- [j1]Shayne Waldron:
Multipoint Taylor formulæ. Numerische Mathematik 80(3): 461-494 (1998)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-20 21:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
