Home
last modified time | relevance | path

Searched refs:f_hat (Results 1 – 25 of 141) sorted by relevance

123456

/dports/math/nfft/nfft-3.5.2/kernel/mri/
H A Dmri.c67 that->plan.f_hat = that->f_hat; in mri_inh_2d1d_trafo()
73 f_hat[j]=that->f_hat[j]; in mri_inh_2d1d_trafo()
91 that->f_hat[j]=f_hat[j]; in mri_inh_2d1d_trafo()
98 nfft_free(f_hat); in mri_inh_2d1d_trafo()
116 that->plan.f_hat = that->f_hat; in mri_inh_2d1d_adjoint()
136 f_hat[j]+=that->f_hat[j]*cexp(2*KPI*_Complex_I*that->w[j]*((double)l)); in mri_inh_2d1d_adjoint()
147 that->f_hat=f_hat; in mri_inh_2d1d_adjoint()
148 that->plan.f_hat = that->f_hat; in mri_inh_2d1d_adjoint()
165 ths->f_hat = ths->plan.f_hat; in mri_inh_2d1d_init_guru()
180 ths->plan.f_hat = ths->f_hat; in mri_inh_2d1d_finalize()
[all …]
/dports/math/nfft/nfft-3.5.2/matlab/tests/
H A DnfftTestcaseCheckDelegate.m14 function plan = prepare(h, plan, f, f_hat)
18 nfft_set_f_hat(plan, f_hat);
22 f_hat = reshape(f_hat, N(end:-1:1)); variable
23 f_hat = permute(f_hat, plan.d:-1:1); variable
24 f_hat = f_hat(:); variable
26 plan.fhat = f_hat;
39 function result = compare(h, plan, f, f_hat)
58 numerator = max(abs(f_hat - plan_f_hat));
H A DnfftTestcaseDelegate.m20 % function setup(h,d, N, NN, M, x, f_hat, f)
22 % h.setup_function(d, N, NN, M, x, f_hat, f);
26 % function destroy(h,x, f_hat, f)
28 % h.destroy(x, f_hat, f);
38 f_hat = []; variable
/dports/math/nfft/nfft-3.5.2/matlab/nfsft/@f_hat/
H A Df_hat.m1 %F_HAT Constructor for f_hat class
19 function p = f_hat(a) function
23 p.f_hat = [];
24 p = class(p,'f_hat');
25 elseif (isa(a,'f_hat'))
29 p.f_hat = zeros((p.N+1)^2,1);
30 p = class(p,'f_hat');
33 p.f_hat = zeros((p.N+1)^2,1);
39 p = class(p,'f_hat');
43 p.f_hat = a(:);
[all …]
H A Dminus.m1 %MINUS Minus for f_hat
21 p = f_hat(p);
22 q = f_hat(q);
26 r = f_hat(p.f_hat - q.f_hat);
H A Dmtimes.m1 %MTIMES Multiply for f_hat
21 p = f_hat(p);
22 q = f_hat(q);
26 r = f_hat(p.f_hat .* q.f_hat);
H A Dplus.m1 %PLUS Plus for f_hat
20 p = f_hat(p);
21 q = f_hat(q);
25 r = f_hat(p.f_hat + q.f_hat);
H A Dmtimesr.m1 %MTIMESR Multiply for f_hat
20 if (isa(p,'f_hat') && isnumeric(q))
21 p = f_hat(p);
25 r = f_hat(p);
27 r.f_hat(k^2+1:k^2+1+2*k) = q(k+1)*r.f_hat(k^2+1:k^2+1+2*k);
/dports/math/nfft/nfft-3.5.2/kernel/nfsft/
H A Dnfsft.c240 plan->f_hat[NFSFT_INDEX(0,n,plan)] = in c2e_transposed()
242 last = plan->f_hat[NFSFT_INDEX(1,n,plan)]; in c2e_transposed()
243 plan->f_hat[NFSFT_INDEX(1,n,plan)] = in c2e_transposed()
360 plan->plan_nfft.f_hat = plan->f_hat; in nfsft_init_guru()
647 nfft_free(plan->f_hat); in nfsft_finalize()
709 plan->f_hat_intern = plan->f_hat; in nfsft_trafo_direct()
1123 plan->f_hat_intern = plan->f_hat; in nfsft_trafo()
1363 plan->plan_nfft.f_hat = plan->f_hat; in nfsft_adjoint()
1380 plan->f_hat[j*N[1]+k] = 0; in nfsft_adjoint()
1384 …fftw_plan plan_fftw = FFTW(plan_dft)(2, N, plan->f_hat, plan->f_hat, FFTW_BACKWARD, FFTW_ESTIMATE); in nfsft_adjoint()
[all …]
/dports/math/nfft/nfft-3.5.2/examples/nfsft/
H A Dnfsft_benchomp_detail.c31 void bench_openmp_readfile(FILE *infile, int *trafo_adjoint, int *N, int *M, double **x, C **f_hat,… in bench_openmp_readfile() argument
39 *f_hat = (C*)nfft_malloc((2*(*N)+2) * (2*(*N)+2) * sizeof(C)); in bench_openmp_readfile()
42 memset(*f_hat,0U,(2*(*N)+2) * (2*(*N)+2) * sizeof(C)); in bench_openmp_readfile()
71 (*f_hat)[NFSFT_INDEX(k,n,&plan)] = re + _Complex_I * im; in bench_openmp_readfile()
86 void bench_openmp(int trafo_adjoint, int N, int M, double *x, C *f_hat, C *f, int m, int nfsft_flag… in bench_openmp() argument
131 memset(plan.f_hat,0U,plan.N_total*sizeof(double _Complex)); in bench_openmp()
137 plan.f_hat[NFSFT_INDEX(k,n,&plan)] = f_hat[NFSFT_INDEX(k,n,&plan)]; in bench_openmp()
149 memset(plan.f_hat,0U,plan.N_total*sizeof(double _Complex)); in bench_openmp()
186 C *f_hat, *f; in main() local
206 bench_openmp_readfile(stdin, &trafo_adjoint, &N, &M, &x, &f_hat, &f); in main()
[all …]
H A Dnfsft_benchomp_createdataset.c34 C *f, *f_hat; in nfsft_benchomp_createdataset() local
44 f_hat = (C*) nfft_malloc(N_total*sizeof(C)); in nfsft_benchomp_createdataset()
57 nfft_vrand_unit_complex(f_hat+NFSFT_INDEX(k,n,&ptemp),1); in nfsft_benchomp_createdataset()
77 …printf("%.16e %.16e\n", creal(f_hat[NFSFT_INDEX(k,n,&ptemp)]), cimag(f_hat[NFSFT_INDEX(k,n,&ptemp)… in nfsft_benchomp_createdataset()
87 nfft_free(f_hat); in nfsft_benchomp_createdataset()
/dports/math/nfft/nfft-3.5.2/examples/nfsoft/
H A Dsimple_test.c80 plan_nfsoft.f_hat[j]=d1 + I*d2; in simple_test_nfsoft()
81 plan_ndsoft.f_hat[j]=d1 + I*d2; in simple_test_nfsoft()
85 …nfft_vpr_complex(plan_nfsoft.f_hat,(bw+1)*(4*(bw+1)*(bw+1)-1)/3,"randomly generated SO(3) Fourier … in simple_test_nfsoft()
87 nfft_vpr_complex(plan_ndsoft.f_hat,20,"1st-20th randomly generated SO(3) Fourier coefficient"); in simple_test_nfsoft()
134 nfft_vpr_complex(plan_nfsoft.f_hat,(bw+1)*(4*(bw+1)*(bw+1)-1)/3,"SO(3) Fourier coefficients"); in simple_test_nfsoft()
136 nfft_vpr_complex(plan_nfsoft.f_hat,20,"adjoint NFSOFT, 1st-20th Fourier coefficient"); in simple_test_nfsoft()
145 nfft_vpr_complex(plan_ndsoft.f_hat,(bw+1)*(4*(bw+1)*(bw+1)-1)/3,"SO(3) Fourier coefficients"); in simple_test_nfsoft()
147 nfft_vpr_complex(plan_ndsoft.f_hat,20,"adjoint NDSOFT, 1st-20th Fourier coefficient"); in simple_test_nfsoft()
152 …error=nfft_error_l_infty_complex(plan_ndsoft.f_hat,plan_nfsoft.f_hat, (bw+1)*(4*(bw+1)*(bw+1)-1)/3… in simple_test_nfsoft()
/dports/science/py-GPy/GPy-1.10.0/GPy/inference/latent_function_inference/
H A Dlaplace.py54 if f_hat is None:
58 W = -likelihood.d2logpdf_df2(f_hat, Y, Y_metadata=Y_metadata)
63 logpdf_dfhat = likelihood.dlogpdf_df(f_hat, Y, Y_metadata=Y_metadata)
70 mu_site = f_hat + var_site*logpdf_dfhat
233 def mode_computations(self, f_hat, Ki_f, K, Y, likelihood, kern, Y_metadata): argument
243 W = -likelihood.d2logpdf_df2(f_hat, Y, Y_metadata=Y_metadata)
250 …log_marginal = -0.5*np.sum(np.dot(Ki_f.T, f_hat)) + np.sum(likelihood.logpdf(f_hat, Y, Y_metadata=…
305 self.f_hat = f_hat
421 W = -likelihood.d2logpdf_df2(f_hat, Y, Y_metadata=Y_metadata)
429 …log_marginal = -0.5*np.dot(f_hat.T, Ki_f) + np.sum(likelihood.logpdf_sum(f_hat, Y, Y_metadata=Y_me…
[all …]
/dports/math/nfft/nfft-3.5.2/examples/nfft/
H A Dsimple_test.c.in47 NFFT(vrand_unit_complex)(p.f_hat,p.N_total);
48 NFFT(vpr_complex)(p.f_hat, p.N_total, "given Fourier coefficients, vector f_hat");
68 NFFT(vpr_complex)(p.f_hat,p.N_total,"adjoint ndft, vector f_hat");
72 NFFT(vpr_complex)(p.f_hat,p.N_total,"adjoint nfft, vector f_hat");
107 NFFT(vrand_unit_complex)(p.f_hat, p.N_total);
110 NFFT(vpr_complex)(p.f_hat,K, "given Fourier coefficients, vector f_hat (first few entries)");
139 NFFT(vpr_complex)(p.f_hat, K, "adjoint ndft, vector f_hat (first few entries)");
146 NFFT(vpr_complex)(p.f_hat, K, "adjoint nfft, vector f_hat (first few entries)");
H A Dtaylor_nfft.c120 C *f, *f_hat, *g1; in taylor_trafo() local
133 - cths->N_total / 2, f_hat = cths->f_hat; k < 0; k++) in taylor_trafo()
134 (*g1++) = CPOW(-K2PI * II * (R)(k), (R)(cths->m)) * (*f_hat++); in taylor_trafo()
136 cths->g1[0] = cths->f_hat[cths->N_total / 2]; in taylor_trafo()
138 for (k = 1, g1 = cths->g1 + 1, f_hat = cths->f_hat + cths->N_total / 2 + 1; in taylor_trafo()
140 (*g1++) = CPOW(-K2PI * II * (R)(k), (R)(cths->m)) * (*f_hat++); in taylor_trafo()
195 np.f_hat = tp.p.f_hat; in taylor_time_accuracy()
213 NFFT(vrand_unit_complex)(np.f_hat, np.N_total); in taylor_time_accuracy()
/dports/math/nfft/nfft-3.5.2/julia/nfct/
H A Dlibnfctjulia.c37 double* jnfct_set_fhat(nfct_plan* p,double* f_hat){ in jnfct_set_fhat() argument
41 p->f_hat[k] = f_hat[k]; in jnfct_set_fhat()
42 return p->f_hat; in jnfct_set_fhat()
63 return p->f_hat; in jnfct_adjoint()
75 return p->f_hat; in jnfct_adjoint_direct()
/dports/math/nfft/nfft-3.5.2/julia/nfft/
H A Dlibnfftjulia.c36 double _Complex* jnfft_set_fhat(nfft_plan* p,double _Complex* f_hat){ in jnfft_set_fhat() argument
40 p->f_hat[k] = f_hat[k]; in jnfft_set_fhat()
41 return p->f_hat; in jnfft_set_fhat()
62 return p->f_hat; in jnfft_adjoint()
74 return p->f_hat; in jnfft_adjoint_direct()
/dports/math/nfft/nfft-3.5.2/julia/nfst/
H A Dlibnfstjulia.c37 double* jnfst_set_fhat(nfst_plan* p,double* f_hat){ in jnfst_set_fhat() argument
41 p->f_hat[k] = f_hat[k]; in jnfst_set_fhat()
42 return p->f_hat; in jnfst_set_fhat()
63 return p->f_hat; in jnfst_adjoint()
75 return p->f_hat; in jnfst_adjoint_direct()
/dports/math/nfft/nfft-3.5.2/tests/
H A Dnfct.c176 p2.f_hat[i] = K(0.0); in trafo_direct_cost()
295 R *f_hat, *f; in check_single() local
430 (*f_hat)[j] = re; in setup_file()
449 Y(free)(f_hat); in destroy_file()
518 p.f_hat[j] = (*f_hat)[j]; in setup_online()
613 (*f_hat)[j] = p.f_hat[j]; in setup_adjoint_online()
624 Y(free)(f_hat); in destroy_online()
689 p->f_hat[j] = f_hat[j]; in prepare_trafo()
697 UNUSED(f_hat); in prepare_adjoint()
710 UNUSED(f_hat); in compare_trafo()
[all …]
H A Dnfst.c176 p2.f_hat[i] = K(0.0); in trafo_direct_cost()
295 R *f_hat, *f; in check_single() local
436 (*f_hat)[j] = re; in setup_file()
456 Y(free)(f_hat); in destroy_file()
525 p.f_hat[j] = (*f_hat)[j]; in setup_online()
620 (*f_hat)[j] = p.f_hat[j]; in setup_adjoint_online()
632 Y(free)(f_hat); in destroy_online()
697 p->f_hat[j] = f_hat[j]; in prepare_trafo()
705 UNUSED(f_hat); in prepare_adjoint()
718 UNUSED(f_hat); in compare_trafo()
[all …]
H A Dnfft.c296 C *f_hat, *f; in check_single() local
435 (*f_hat)[j] = re + im * I; in setup_file()
454 Y(free)(f_hat); in destroy_file()
527 p.f_hat[j] = (*f_hat)[j]; in setup_online()
626 (*f_hat)[j] = p.f_hat[j]; in setup_adjoint_online()
637 Y(free)(f_hat); in destroy_online()
721 p->f_hat[j] = f_hat[j]; in prepare_trafo()
729 UNUSED(f_hat); in prepare_adjoint()
742 UNUSED(f_hat); in compare_trafo()
775 numerator = MAX(numerator, CABS(f_hat[j] - p->f_hat[j])); in compare_adjoint()
[all …]
/dports/math/nfft/nfft-3.5.2/kernel/nsfft/
H A Dnsfft.c48 plan_1d->f_hat = ths->f_hat + k0*ths->N[1]; in short_nfft_trafo_2d()
76 plan_1d->f_hat = ths->f_hat + k0*ths->N[1]; in short_nfft_adjoint_2d()
99 plan_1d->f_hat = ths->f_hat + (k0*ths->N[1]+k1)*ths->N[2]; in short_nfft_trafo_3d_1()
130 plan_1d->f_hat = ths->f_hat + (k0*ths->N[1]+k1)*ths->N[2]; in short_nfft_adjoint_3d_1()
153 plan_2d->f_hat = ths->f_hat + k0*ths->N[1]*ths->N[2]; in short_nfft_trafo_3d_2()
184 plan_2d->f_hat = ths->f_hat + k0*ths->N[1]*ths->N[2]; in short_nfft_adjoint_3d_2()
911 ths->act_nfft_plan->f_hat=ths->f_hat+(4*rr+0)*X(exp2i)(J); in nsfft_trafo_2d()
932 ths->act_nfft_plan->f_hat=ths->f_hat+(4*rr+1)*X(exp2i)(J); in nsfft_trafo_2d()
953 ths->act_nfft_plan->f_hat=ths->f_hat+(4*rr+2)*X(exp2i)(J); in nsfft_trafo_2d()
974 ths->act_nfft_plan->f_hat=ths->f_hat+(4*rr+3)*X(exp2i)(J); in nsfft_trafo_2d()
[all …]
/dports/science/octopus/octopus-10.5/src/math/
H A Dnfft_f.c204 plan->f_hat[ix-1] = val; in FC_FUNC()
207 plan->f_hat[(ix-1)*plan->N[1] + (iy-1)] = val; in FC_FUNC()
210 plan->f_hat[(ix-1)*plan->N[1]*plan->N[2] + (iy-1)*plan->N[2] + (iz-1)] = val; in FC_FUNC()
228 *val = plan->f_hat[ix-1]; in FC_FUNC()
231 *val = plan->f_hat[(ix-1)*plan->N[1] + (iy-1)]; in FC_FUNC()
234 *val = plan->f_hat[(ix-1)*plan->N[1]*plan->N[2] + (iy-1)*plan->N[2] + (iz-1)]; in FC_FUNC()
303 plan->f_hat[ix-1] = val; in FC_FUNC()
306 plan->f_hat[(ix-1)*plan->N[1] + (iy-1)] = val; in FC_FUNC()
309 plan->f_hat[(ix-1)*plan->N[1]*plan->N[2] + (iy-1)*plan->N[2] + (iz-1)] = val; in FC_FUNC()
327 *val = plan->f_hat[ix-1]; in FC_FUNC()
[all …]
/dports/math/nfft/nfft-3.5.2/matlab/nfft/
H A Dsimple_test.m44 f_hat = rand(N,1)+1i*rand(N,1); variable
47 nfft_set_f_hat(plan,double(f_hat));
59 f2=A*f_hat
62 error_linfl1=norm(f-f2,inf)/norm(f_hat,1)
74 f_hat = rand(N,N)+1i*rand(N,N); variable
75 nfft_set_f_hat(plan,double(f_hat(:)));
86 e=norm(f-f2,inf)/norm(f_hat(:),1);
107 f_hat = rand(N1,N2,N3)+1i*rand(N1,N2,N3); variable
108 nfft_set_f_hat(plan,double(f_hat(:)));
119 e=norm(f-f2,inf)/norm(f_hat(:),1);
/dports/math/nfft/nfft-3.5.2/kernel/solver/
H A Dsolver.c106 CSWAP(ths->z_hat_iter, ths->mv->f_hat); in X()
108 CSWAP(ths->z_hat_iter, ths->mv->f_hat); in X()
161 CSWAP(ths->z_hat_iter,ths->mv->f_hat); in solver_loop_one_step_landweber_complex()
163 CSWAP(ths->z_hat_iter,ths->mv->f_hat); in solver_loop_one_step_landweber_complex()
220 CSWAP(ths->z_hat_iter,ths->mv->f_hat); in solver_loop_one_step_steepest_descent_complex()
222 CSWAP(ths->z_hat_iter,ths->mv->f_hat); in solver_loop_one_step_steepest_descent_complex()
275 CSWAP(ths->z_hat_iter,ths->mv->f_hat); in solver_loop_one_step_cgnr_complex()
277 CSWAP(ths->z_hat_iter,ths->mv->f_hat); in solver_loop_one_step_cgnr_complex()
512 RSWAP(ths->z_hat_iter,ths->mv->f_hat); in solver_loop_one_step_landweber_double()
514 RSWAP(ths->z_hat_iter,ths->mv->f_hat); in solver_loop_one_step_landweber_double()
[all …]

123456