scientific article; zbMATH DE number 3446914
From MaRDI portal
Publication:4770972
Cited in
(19)- On some optimal fractional \(2^ m \)factorial designs of resolution V
- On the robustness of the optimum balanced \(2^ m\) factorial designs of resolution V (given by Srivastava and Chopra) in the presence of outliers
- Weighted A-optimality for fractional \(2^m\) factorial designs of resolution \(V\)
- On the robustness of balanced fractional \(2^ m\) factorial designs of resolution \(2l+1\) in the presence of outliers
- Block plan for a fractional \(2^ m\) factorial design derived from a \(2^ r\) factorial design
- Search designs for \(2^ m\) factorials derived from balanced arrays of strength \(2(\ell +1)\) and AD-optimal search designs
- Further investigations on balanced arrays
- On aliasing and generalized defining relationships of factorial arrangements
- J.N. Srivastava and experimental design
- Balanced arrays of strength 4 and balanced fractional \(3^m\) factorial designs
- Robustness of balanced fractional \(2^ m\) factorial designs derived from simple arrays
- On robustness of optimal balanced resolution V plans
- On the characteristic polynomial of the information matrix of balanced fractional \(s^ m\) factorial designs for resolution \(V_{p,q}\)
- A-optimal partially balanced fractional \(2^{m_ 1+m_ 2}\) factorial designs of resolution V, with \(4\leq m_ 1+m_ 2\leq 6\)
- Characteristic polynomials of the information matrices of balanced fractional \(3^ m\) factorial designs of resolution V
- On the norm of alias matrices in balanced fractional \(2^m\) factorial designs of resolution \(2l+1\)
- Orthogonal designs of parallel flats type
- Bounds on the number of constraints for balanced arrays of strength t
- Fractional factorial designs of two and three levels
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4770972)
