Skip to main content
Search type Search syntax
Tags [tag]
Exact "words here"
Author user:1234
user:me (yours)
Score score:3 (3+)
score:0 (none)
Answers answers:3 (3+)
answers:0 (none)
isaccepted:yes
hasaccepted:no
inquestion:1234
Views views:250
Code code:"if (foo != bar)"
Sections title:apples
body:"apples oranges"
URL url:"*.example.com"
Saves in:saves
Status closed:yes
duplicate:no
migrated:no
wiki:no
Types is:question
is:answer
Exclude -[tag]
-apples
For more details on advanced search visit our help page
Results tagged with
Search options not deleted user 9692
0 votes
3 answers
558 views

Calculating integrals for a function approximated by Chebyshev polynomials

Setup (complete, but all very standard): My problem is how to best calculate the cumulative integral of a function which comes out of Spectral Collocation with a chebyshev basis. … end{align} Which gives the complete set of integrals as, $$ \vec{F} =\Omega \cdot (\vec{f}(0:N) + \vec{f}(1:N+1))\in\mathbb{R}^{N+2} $$ This is especially useful for me because I am solving a spectral collocation
1 vote
0 answers
48 views

Numerically inverting an exponentially growing function (defined by Chebyshev polynomials)

The function $M(t)$ will be solved numerically with some sort of spectral collocation method with a polynomial basis (see below). … find the appropriate $M$, and then use some sort of interpolation to find the approximating $q(M)$, but I would prefer an approach that has a chance of using auto-differentiation by throwing it into my collocation