We are investigating a kernel-based autoconvolution problem, which has its origin in the physics of ultra short laser pulses. The task in this problem is to reconstruct a complex-valued function $x$ on a finite interval from measurements of its absolute value and a kernel-based autoconvolution of the form [[F(x)](s)=int k(s,t)x(s-t)x(t)de t.]
This problem has not been studied in the literature. One reason might be that one has more information than in the classical autoconvolution case, where only the right hand side is available. Nevertheless we show that ill posedness phenomena may occur. We also propose an algorithm to solve the problem numerically and demonstrate its performance with artificial data. Since the algorithm fails to produce good results with real data and we suspect that the data for $|F(x)|$ are not dependable we also consider the whole problem with only $arg(F(x))$ given instead of $F(x)$.
| Identifer | oai:union.ndltd.org:DRESDEN/oai:qucosa:de:qucosa:20138 |
| Date | January 2014 |
| Creators | Bürger, Steven |
| Publisher | Technische Universität Chemnitz |
| Source Sets | Hochschulschriftenserver (HSSS) der SLUB Dresden |
| Language | English |
| Detected Language | English |
| Type | doc-type:preprint, info:eu-repo/semantics/preprint, doc-type:Text |
| Rights | info:eu-repo/semantics/openAccess |
Page generated in 0.0015 seconds