A numerical approach for computing standard errors of linear equating
1993
Loading...
View/Download File
Persistent link to this item
Statistics
View StatisticsJournal Title
Journal ISSN
Volume Title
Title
A numerical approach for computing standard errors of linear equating
Authors
Published Date
1993
Publisher
Type
Article
Abstract
A numerical approach for computing standard
errors (SEs) of a linear equating is described. In
the proposed approach, the first partial derivatives
of the equating function needed to compute the
SEs are derived numerically. Thus, the difficulty of
deriving the analytical formulas of the partial
derivatives for a complicated equating method is
avoided. The numerical and analytical approaches
were compared using the Tucker equating method.
The SEs derived numerically were found to be
indistinguishable from the SEs derived analytically.
In a computer simulation of the numerical
approach using the Levine equating method, the
SEs based on the normality assumption were found
to be less accurate than those derived without the
normality assumption when the score distributions
were skewed. Index terms: common-item design,
Levine equating method, linear equating, standard
error of equating, Tucker equating method.
Keywords
Description
Related to
Replaces
License
Series/Report Number
Funding information
Isbn identifier
Doi identifier
Previously Published Citation
Zeng, Lingjia. (1993). A numerical approach for computing standard errors of linear equating. Applied Psychological Measurement, 17, 177-186. doi:10.1177/014662169301700207
Suggested citation
Zeng, Lingjia. (1993). A numerical approach for computing standard errors of linear equating. Retrieved from the University Digital Conservancy, https://hdl.handle.net/11299/116359.
Content distributed via the University Digital Conservancy may be subject to additional license and use restrictions applied by the depositor. By using these files, users agree to the Terms of Use. Materials in the UDC may contain content that is disturbing and/or harmful. For more information, please see our statement on harmful content in digital repositories.