Chebyshev Polynomial

[[concept]]

Chebyshev Polynomial

The Chebyshev Polynomials can be calculated using the recurrence relation:

T_{0}(\lambda) &=1 \\ T_{1}(\lambda) &= \lambda\\ &\vdots \\ T_{k+1}(\lambda) &= 2\lambda T_{k}(\lambda) - T_{k-1}(\lambda) \end{aligned}$$ And each $T_{n}$ has the property that $T_{n} = \cos(n\theta)$ ^definition

References

See Also

Mentions

Mentions

const modules = await cJS()
 
const COLUMNS = [  
	{ id: "Name", value: page => page.$link },  
	{ id: "Last Modified", value: page => modules.dateTime.getLastMod(page) },
];  
  
return function View() {  
	const current = dc.useCurrentFile();
// Selecting `#game` pages, for example. 
	let queryString = `@page and linksto(${current.$link})`;
	let pages = dc.useQuery(queryString);
	
	// check types
	pages = pages.filter( (p) => !modules.typeCheck.checkAll(p, current) ).sort()
	
	
	return <dc.Table columns={COLUMNS} rows={pages} paging={20}/>;  
}  

const { dateTime } = await cJS()
 
return function View() {
	const file = dc.useCurrentFile();
	return <p class="dv-modified">Created {dateTime.getCreated(file)}     ֍     Last Modified {dateTime.getLastMod(file)}</p>
}