- #1
member 428835
Given a function ##\psi## having ##N## components, how would you (as fast as possible) construct ##\psi'## also having ##N## components? I thought about taking a forward finite difference approach on the first ##N-1## components of ##\psi## to generate ##\psi'## and then a backward finite difference approach to generate the last (##Nth##) component of ##\psi'##.
Any faster ideas or better ways? Thanks!
Any faster ideas or better ways? Thanks!